Techniques for automatically designing structural systems for buildings

ABSTRACT

In various embodiments, a gravity design application automatically generates a design for a structural system of a building. The gravity design application performs partitioning operation(s) based on an outline of a first floor included in a computer-aided design of the building to generate a set of segments. Subsequently, the gravity design application generates a set of segment designs based on the set of segments, constraint(s), and design objective(s). The set of segment designs includes at least one segment design for each of the segments included in the set of segments. The gravity design application determines a combination of floor designs from multiple sets of floor designs based the design objective(s), where each set of floor designs is associated with a different floor of the computer-aided design of the building. The gravity design application generates the design for the structural system of the building based on the combination of floor designs.

BACKGROUND Field of the Various Embodiments

The various embodiments relate generally to structural engineering andcomputer-aided design and, more specifically, to techniques forautomatically designing structural systems for buildings.

Description of the Related Art

In a typical design process for a building, an architect generates abuilding plan that specifies an outline for the building, one or moreoutlines for each floor of the building, and any number of architecturalelements that are going to be included in the building. Some examples ofarchitectural elements include, without limitations walls, elevators,and stairs. Once the building plan is completed, a structural engineerthen designs the structural system for the building based on thebuilding plan, various design constraints placed on the building,different design objectives for the building, and various designvariables. The structural system includes any number of structuralmembers that, together, enable the building to resist various loads asper the design constraints. For example, the structural system of agiven building could include slabs, beams, and columns that enable thebuilding to resist vertical loads attributable to gravity and lateralloads attributable to hurricane force winds without exceeding allowablestresses. To the extent any changes are made to the building plan, thedesign constraints, the design objectives, the design variables, orloads during the design process, the structural engineer has to redesignthe structural system to account for those changes.

In one approach to designing a structural system of a building, astructural engineer independently generates different designs for thestructural system using a conventional computer-aided design (“CAD”)application, where each design satisfies the various design constraintsplaced on the building To generate a given design for the structuralsystem, the structural engineer typically generates a baseline designbased on the building plan, design and structural engineeringfundamentals, and design insight stemming from the structural engineer'soverall design experience. The baseline design specifies, among otherthings, a layout for the structural members of the building as well asthe sizes used for the structural members. Using the CAD application,the structural engineer then incrementally refines the baseline design,typically implementing a finite element analysis solver to evaluatedesign decisions and validate the resulting final design. After thestructural engineer generates multiple finalized designs for thestructural system, the designs are compared based on the differentdesign objectives for the building, and a single finalized design forthe structural system is selected.

One drawback of the above approach to generating a finalized design forthe structural system of a building is that conventional CADapplications are not configured to effectively explore the overalldesign space for a given structural system. Consequently, the finalizeddesign for a structural system generated using a conventional CADapplication usually is not properly optimized for the different designobjectives for the relevant building. In that regard, because evaluatingdesign decisions involves executing computationally complex finiteelement analysis operations for numerous refined designs, the process ofrefining a baseline design is normally very time-consuming. Accordingly,in a typical design process, only a handful of baseline designs for agiven structural system can be generated and refined. Further, astructural engineer may make conservative design decisions in order toreduce the time required to generate the finalized designs at theexpense of any number of the design objectives. For example, astructural engineer could overestimate the sizes required for some ofthe structural elements to increase the likelihood that these structuralelements are included in the finalized design without furthermodification. In such a situation, the structural engineer wouldintentionally neglect to explore and evaluate structural system designsthat are more convergent with respect to a design objective ofminimizing weight.

The above problems are exacerbated as the complexity and size of abuilding increase. For example, for a typical multi-story building, thetotal number of different combinations of values for the relevant designvariables, where each combination results in different design for thestructural system of the building, could be over half a million. With aconventional CAD application, there is no way to ensure that astructural engineer has accounted for all of these differentcombinations and resulting designs when generating the finalized designfor the structural system of the building. In fact, as noted above, thestructural engineer most likely would account for only a handful of thetotal number of possible designs in such a situation, whichsubstantially reduces the likelihood that the finalized design isproperly optimized.

As the foregoing illustrates, what is needed in the art are moreeffective techniques for generating designs for the structural systemsof buildings.

SUMMARY

One embodiment of the present invention sets forth acomputer-implemented method for automatically generating a design for astructural system for a building. The method includes performing one ormore partitioning operations based on a first outline of a first floorincluded in a computer-aided design of the building to generate a firstset of segments; generating a set of segment designs based on the firstset of segments, one or more constraints, and one or more designobjectives, where the set of segment designs includes at least onesegment design for each of the segments included in the first set ofsegments; performing one or more merging operations based on the set ofsegment designs to generate a first set of floor designs; determining afirst combination of floor designs from multiple sets of floor designs,including the first set of floor designs, based on the one or moredesign objectives, where each set of floor designs included in themultiple sets of floor designs is associated with a different floor ofthe computer-aided design of the building; and generating the design forthe structural system of the building based on the first combination offloor designs.

At least one technical advantage of the disclosed techniques relative tothe prior art is that the disclosed techniques can be incorporated intoa CAD application to enable the CAD application to automatically explorea design space to identify regions where the structural system of abuilding is optimized for any number of design objectives. In thatregard, with the disclosed techniques, a CAD application is able tobreak a complex overall design optimization problem into simpleroptimization problems involving different aspects of a structural systemdesign. Accordingly, the CAD application is able to explore the overalldesign in a far more efficient and systematic fashion. Thisfunctionality, which is not available in conventional CAD applications,increases the likelihood that an optimized design for the structuralsystem that is convergent with building design objectives can beidentified and generated. These technical advantages provide one or moretechnological improvements over prior art approaches.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above recited features of the variousembodiments can be understood in detail, a more particular descriptionof the inventive concepts, briefly summarized above, may be had byreference to various embodiments, some of which are illustrated in theappended drawings. It is to be noted, however, that the appendeddrawings illustrate only typical embodiments of the inventive conceptsand are therefore not to be considered limiting of scope in any way, andthat there are other equally effective embodiments.

FIG. 1 is a conceptual illustration of a system configured to implementone or more aspects of the various embodiments;

FIG. 2 is a more detailed illustration of the gravity design applicationof FIG. 1, according to various embodiments;

FIG. 3 is a more detailed illustration of the gravity design optimizerof FIG. 2, according to various embodiments;

FIG. 4 is a more detailed illustration of the grid generationapplication of FIG. 1, according to various embodiments;

FIG. 5 is a more detailed illustration of the frame specificationapplication of FIG. 1, according to various embodiments;

FIG. 6 is a more detailed illustration of the iterative sizingapplication of FIG. 1, according to various embodiments;

FIGS. 7A-7B set forth a flow diagram of method steps for generating adesign for a structural system of a building, according to variousembodiments;

FIGS. 8A-8B set forth a flow diagram of method steps for generating aframe grid for a structural system of a building, according to variousembodiments;

FIG. 9 is a flow diagram of method steps for generating a design for aframe system associated with a building, according to variousembodiments; and

FIGS. 10A-10B set forth a flow diagram of method steps for designing astructural system of a building to resist a lateral load, according tovarious embodiments.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth toprovide a more thorough understanding of the various embodiments.However, it will be apparent to one skilled in the art that theinventive concepts may be practiced without one or more of thesespecific details.

System Overview

FIG. 1 is a conceptual illustration of a system 100 configured toimplement one or more aspects of the various embodiments. As shown, thesystem 100 includes, without limitation, a display device 104 and acompute instance 110. For explanatory purposes, multiple instances oflike objects are denoted with reference numbers identifying the objectand parenthetical alphanumeric character(s) identifying the instancewhere needed.

Any number of the components of the system 100 can be distributed acrossmultiple geographic locations or implemented in one or more cloudcomputing environments (i.e., encapsulated shared resources, software,data, etc.) in any combination. In some embodiments, the system 100 caninclude, without limitation, any number (including zero) of instances ofthe display device 104 and any number of instances of the computeinstance 110. In the same or other embodiments, each instance of thecompute instance 110 can be implemented in a cloud computingenvironment, implemented as part of any other distributed computingenvironment, or implemented in a stand-alone fashion.

As shown, the compute instance 110 includes, without limitation, aprocessor 112 and a memory 116. The processor 112 can be any instructionexecution system, apparatus, or device capable of executinginstructions. For example, the processor 112 could comprise a centralprocessing unit, a graphics processing unit, a controller, amicro-controller, a state machine, or any combination thereof. Thememory 116 stores content, such as software applications and data, foruse by the processor 112. In some alternate embodiments, each of anynumber of instances of the compute instance 110 can include any numberof instances of the processor 112 and any number of instances of thememory 116 in any combination. In particular, any number of instances ofthe compute instance 110 (including one) can provide a multiprocessingenvironment in any technically feasible fashion.

The memory 116 can be one or more of a readily available memory, such asrandom-access memory, read only memory, floppy disk, hard disk, or anyother form of digital storage, local or remote. In some embodiments, astorage (not shown) can supplement or replace the memory 116. Thestorage can include any number and type of external memories that areaccessible to the processor 112. For example, and without limitation,the storage can include a Secure Digital Card, an external Flash memory,a portable compact disc read-only memory, an optical storage device, amagnetic storage device, or any suitable combination of the foregoing.

As shown, in some embodiments, the compute instance 110 is associatedwith the display device 104. The display device 104 can be any devicethat is capable of displaying an image and/or any other type of visualcontent. For example, the display device 104 could be, withoutlimitation, a liquid crystal display, a light-emitting diode display, aprojection display, a plasma display panel, etc. In some embodiments,the display device 104 is a touchscreen that is capable of displayingvisual content and receiving input (e.g., from a user).

In some embodiments, the compute instance 110 can be integrated with anynumber and/or types of other devices (e.g., other instances of thecompute instance 110, input devices, output devices, input/outputdevices, etc.) into a user device. Some examples of user devicesinclude, without limitation, desktop computers, laptops, smartphones,smart televisions, game consoles, tablets, etc.

In general, each instance of the compute instances 110 is configured toimplement one or more software applications. For explanatory purposesonly, each software application is described as residing in the memory116 of the compute instance 110 and executing on the processor 112 ofthe compute instance 110. However, in some embodiments, thefunctionality of any number of software applications can be distributedacross any number of other software applications that reside ininstances of the memory 116 of any number of instances of the computeinstance 110 and execute on any number of instances of the processor 112of any number of instances of the compute instance 110 in anycombination. Further, the functionality of any number of softwareapplications can be consolidated into a single software application.

In particular, the compute instance 110 is configured to implement oneor more computer-aided design (“CAD”) applications that can be used toautomatically design structural systems of buildings. As describedpreviously herein, in one conventional approach to designing astructural system of a building, a structural engineer uses one or moreconventional CAD applications to independently generate multiplebaseline designs based on a building plan, design and structuralengineering fundamentals, and design insight stemming from thestructural engineer's overall design experience. The structural engineerthen uses the conventional CAD application(s) to incrementally refinethe baseline designs, typically executing a finite element analysissolver to evaluate design decisions and validate the resulting finaldesigns. After the structural engineer generates multiple finalizeddesigns for the structural system, the designs are compared based on thedifferent design objectives for the building, and a single finalizeddesign for the structural system is selected.

One drawback of the above approach to generating a finalized design forthe structural system of a building is that conventional CADapplications are not configured to effectively explore the overalldesign space for a given structural system. In particular, becauseevaluating design decisions involves executing computationally complexfinite element analysis operations for numerous refined designs, theprocess of refining a baseline design is normally very time-consuming.Accordingly, in a typical design process, only a handful of baselinedesigns for a given structural system can be generated and refined. As aresult, the finalized design for a structural system generated usingconventional CAD application(s) usually is not properly optimized forthe different design objectives for the associated building.

Generative Design Techniques for Designing a Structural System of aBuilding

To address the above problems, in some embodiments, the compute instance110 includes, without limitation, a structural design application 120.The structural design application 120 is a CAD application thatimplements generative design techniques to generate designs for astructural system of a building based on any number and/or type ofdesign objectives and any and/or types of design constraints. Asdescribed in greater detail below, the structural design application 120defines an overall optimization design problem and then breaks theoverall optimization design problem into multiple layers of less complexoptimization problems referred to herein as constituent optimizationproblems. Each of the constituent optimization problems is associatedwith a different aspect of structural system design. To solve theoverall optimization design problem, the structural design application120 executes an overall design flow that dynamically self-adjusts basedon results generating while solving the constituent optimizationproblems.

In some embodiments, the structural design application 120 resides inthe memory 116 of the compute instance 110 and executes on the processor112 of the compute instance 110. In general, the functionality of thestructural design application 120 can be distributed across any numberof software applications. Each of the software applications can residein any number of instances of the memory 116 of any number of instancesof the compute instances 110 and execute on any number of instances ofthe processor 112 of any number of instances of the compute instances110 in any combination.

As shown, in some embodiments, the structural design application 120includes, without limitation, an interface engine 108, a gravity designapplication 140, a grid generation application 150, any number ofinstances of an iterative optimization application 172 (not explicitlyshown), and an overall ranking engine 190. In the same or otherembodiments, the iterative optimization application 172 includes,without limitation, a frame specification application 170 and aniterative sizing application 180.

In some embodiments, the interface engine 108 displays a graphical userinterface (“GUI”) 106 via the display device 104. The interface engine108 can receive number and/or types of inputs via the GUI 106 and candisplay any number and/or types of outputs via the GUI 106. In someembodiments, the interface engine 108 receives any number and/or typesof design constraints (not shown) and/or any number and/or types ofdesign objectives (not shown) via the GUI 106. In the same or otherembodiments, the interface engine 108 displays a portion (including noneor all) of any number of solutions of the overall optimization designproblem and/or any number of solutions of the constituent optimizationproblems via the GUI 106.

In some embodiments, the structural design application 120 generates adesign problem definition 122 that describes the overall designoptimization problem and specifies, without limitation, any amountand/or types of ancillary data. The structural design application 120can generate the design problem definition 122 in any technicallyfeasible fashion based on any amount and/or type of input data. Asshown, in some embodiments, the structural design application 120generates the design problem definition 122 based, at least in part, oninput received via the GUI 106. In the same or other embodiments, theinterface engine 108 can display a portion (including none or all) ofthe design problem definition 122 via the GUI 106.

The overall design optimization problem is to generate any number ofdesigns for a structural system of a building based on any number and/ortypes of design objectives and any number and/or type of designconstraints. In some embodiments, the design problem definition 122includes, without limitation, a building plan 124 that is included in acomputer-aided design of a building (not shown), design instructions130, wind directions 164(1)-164(W), and building wind load data 162,where W can be any positive integer.

In some embodiments, the building plan 124 includes, without limitation,a building outline 126, and floor outlines 128(1)-128(F), where F can beany positive integer. The building outline 126 is an outline of abuilding that has F floors. For explanatory purposes only, “thebuilding” as used subsequently herein refers to the building associatedwith the building plan 124. Each of the floor outlines 128(1)-128(F) isan outline of a different floor of the building. For explanatorypurposes only, the floor outlines 128(1)-128(F) are also referred toindividually as “floor outline 128” and collectively as “the flooroutlines 128.”

In the same or other embodiments, the building plan 124 can include anyamount and/or type of data that is relevant to the designing thestructural system for the building instead of or in addition to thebuilding outline 126 and/or the floor outlines 128. For instance, insome embodiments, the building plan 124 includes, without limitation,floorplans (not shown) for each of the floors, where each of thefloorplans specifies the floor outline 128, any number of rooms,occupancy type for each room, and/or any number of walls. In the same orother embodiments, the building plan 124 includes, without limitation, apre-defined column grid (not shown), where the locations of frames arerestricted to grid lines included in the pre-defined column grid.

As shown, in some embodiments the design instructions 130 include,without limitation, constraints 132, an objective function 134, designvariable data 136, and parameter data 138. The constraints 132 canspecify any amount and/or types of restrictions associated with thebuilding. For instance, in some embodiments, the constraints 132include, without limitation, any number of design constraints that arespecified at a high level by a user (e.g., via the GUI 106), any numberof restrictions derived based on the design constraints and/or any othertypes of user input, any number and/or types of restrictions associatedwith the building plan 124, any number and/or types of restrictionsassociated with any number and/or types of building codes and/or zoningregulations, and/or any number and/or types of restrictions associatedwith any aspect(s) of construction.

The structural design application 120 can generate the constraints 132in any technically feasible fashion. For instance, in some embodiments,the user specifies a pre-defined column grid via the GUI 106. Based onthe pre-defined column grid, the structural design application 120generates any number of the constraints 132 that restrict the locationsof columns in accordance to the pre-defined column grid and/or adds thepre-defined column grid to the design instructions 130.

In the same or other embodiments, the structural design application 120generates any number of the constraints 132 that specify, withoutlimitation, any number of design safety factors associated with anynumber and/or type of building codes. In some embodiments, each of thedesign safety factors specifies, without limitation, a maximum allowablestress (e.g., a shear stress, a bending stress, etc.) for a type ofstructural member under one or more types of loads. Some examples ofdesign safety factors include, without limitation, bending and verticaldeflection safety factors for beams and slabs, shear safety factors forbeams and slabs, a vibration safety factor for slabs, and lateraldeflection limits on frames. In some embodiments, design safety factorscan be defined separately for serviceability limit states and ultimatelimit states.

The objective function 134 encapsulates any number and/or types ofdesign objectives in any technically feasible fashion. Some examples ofdesign objectives include, without limitation, minimizing total weight,minimizing embodied carbon, minimizing material cost, and minimizingmaterial waste, to name a few. In some embodiments, the structuraldesign application 120 receives the objective function 134 as a userinput (e.g., via the GUI 106). In other embodiments, the structuraldesign application 120 can generate the objective function 134 in anytechnically feasible fashion.

In some embodiments, the objective function 134 quantifies degrees ofconvergence of designs or any portions thereof with the designobjectives. The objective function 134 can be expressed in anytechnically feasible fashion. In some embodiments, the objectivefunction 134 is a composite function. In the same or other embodiments,the objective function 134 is an aggregation of metrics that are eachassociated with one or more of the design objectives.

Values of the objective function 134 are also referred to hereincollectively as “objective values” and individually as an “objectivevalue.” In some embodiments, the structural design application 120attempts to maximize the objective function 134. In some otherembodiments, the structural design application 120 attempts to minimizethe objective function 134. In some embodiments, the structural designapplication 120 incorporates any number and/or type of the constraints132 into the objective function 134 as penalties in any technicallyfeasible fashion. In the same or other embodiments, any number ofpenalties are disregarded during different optimization operationsdepending on the design variable(s) that are optimized during theoptimization operations. For instance, in some embodiments, theiterative sizing application 180 disregards any penalties associatedwith grid spacing.

The design variable data 136 includes, without limitation, any amountand/or type of data that defines, at least in part, the design space ofthe structural system that is associated with the design problemdefinition 122. For instance, in some embodiments, the design variabledata 136 includes, without limitation, any number of cross-sectiondatabases for any number of types of structural members, any numberand/or types of allowed dimension ranges for any number of types ofstructural members, local availability and relative and/or actual costof each material (reinforced concrete, precast concrete, reinforcedmasonry, structural steel, cold-formed steel, wood, etc.), embodiedcarbon, or any combination thereof.

The parameter data 138 includes, without limitation, values for anynumber and/or types of parameters that are relevant to the structuraldesign application 120, the gravity design application 140, the gridgeneration application 150, the iterative optimization application 172,the frame specification application 170, the iterative sizingapplication 180, or any combination thereof. In some embodiments, theparameter data 138 includes, without limitation, a maximum variationcount (not shown), denoted herein as N, that limits the total number ofoptions that are retained at any number of points in the overall designflow and/or any number of points in any number of design flowsassociated with any number of the constituent optimization problems. Inthe same or other embodiments, the parameter data 138 includes, withoutlimitation, any number and/or type of completion criteria associatedwith any number of iterative portions of the overall design flow and/orany number of design flows associated with any number of the constituentoptimization problems. In some embodiments, the parameter data 138 caninclude any number and/or types of groups of setting based on tradeoffbetween accuracy and speed.

The wind directions 164(1)-164(W) specify any number of directionsassociated with wind loads that the structural design application 120 isto take into account. In some embodiments, each of the wind loads is aload imparted by wind of the building. For explanatory purposes only,the wind directions 164(1)-164(W) are also referred to hereinindividually as “the wind direction 164” and collectively as “the winddirections 164.” In some embodiments, the structural design application120 determines the wind directions 164 based on user input (e.g.,received via the GUI 106). In the same or other embodiments, thestructural design application 120 can determine the wind directions 164in any technically feasible fashion.

The building wind load data 162 specifies, without limitation, anyamount and/or type of lateral loads attributable to wind that thebuilding is to be designed to resist. In some embodiments, the buildingwind load data 162 includes, without limitation, a different buildingwind load (not shown) for each of the wind directions 164(1)-164(W). Thestructural design application 120 or the iterative sizing application180 can determine the building wind load data 162 in any technicallyfeasible fashion. For instance, in some embodiments, the structuraldesign application 120 or the iterative sizing application 180 computesthe building wind load data 162 based on the building outline 126,locations of walls, the structural system being created, and user input(e.g., received via the GUI 106) that specifies, without limitation, amean wind speed, a structural factor, a terrain category, an orographyfactor. or any combination thereof.

In some embodiments, after generating the design problem definition 122,the structural design application 120 defines the overall designoptimization problem as generating any number of designs of thestructural system of the building based on the objective function 134and the constraints 132 while taking into account gravity and thebuilding wind load(s). The structural design application 120 then breaksthe overall design problem into the constituent optimization problems.In some embodiments, the structural design application 120 breaks theoverall design problem into a layout and gravity design optimizationproblem, a frame grid optimization problem, a frame system definitionoptimization problem, a vertical and lateral load design optimizationproblem, or any combination thereof.

In some embodiments, to initiate the overall design flow, the structuraldesign application 120 configures the gravity design application 140 tosolve the layout and gravity design optimization problem. Morespecifically, in some embodiments, the structural design application 120configures the gravity design application 140 to generate gravitydesigns 148(1)-148(N) and optionally evaluate gravity design objectivevalues 146(1)-146(N) based on the building plan 124 and the designinstructions 130, where N can be any positive integer. For explanatorypurposes only, the gravity designs 148(1)-148(N) are also referred toherein individually as “the gravity design 148” and collectively as “thegravity designs 148.” Similarly, the gravity design objective values146(1)-146(N) are also referred to herein individually as “the gravitydesign objective value 146” and collectively as “the gravity designsobjective values 146.”

Each of the gravity designs 148 is a different CAD design for thestructural system of the building that is optimized based on theobjective function 134 and the constraints 132 while taking into accountgravity but not the building wind load(s). A “CAD design” is alsoreferred to herein as a “design.” In some embodiments, a design of anyportion (including all) of the structural system specifies, withoutlimitation, a CAD layout (not shown in FIG. 1) for the portion of thestructural system and any amount and/or types of sizing data (not shownin FIG. 1). In the same or other embodiments, each design for anyportion (including all) of the structural system can additionallyspecify, without limitation, any amount and/or types of connection data(not shown in FIG. 1), a frame system (not shown in FIG. 1), any amountand/or types of load data (not shown in FIG. 1), or any combinationthereof.

A “CAD layout” is also referred to herein as a “layout.” In someembodiments, a “layout” of any portion (including all) of the structuralsystem specifies, without limitation, locations, types, and materialsfor each of any number of structural members included in the portion ofthe structural system. In some embodiments, the structural membersspecified in each of the layouts include, without limitation, any numberof slabs, beams, and columns in any combination.

In some embodiments, the sizing data includes, without limitation,sizing of any number and/or types of the structural members specified inthe layout. As referred to herein, the sizing of a given structuralelement can specify, without limitation, any amount and/or types of datathat impact the size of the structural element. For instance, in someembodiments, the sizing of a reinforced concrete flat slab specifies thegrade of concrete, thickness of the slab and a thickness anddistribution of the reinforcement. In the same or other embodiments, thesizing of a steel column specifies a cross-section profile.

In some embodiments, the connection data specifies, without limitation,any number and/or types of joints. Some examples of types of jointsinclude, without limitation, rigid joints, semi-rigid joints, hingedjoints, pin joints, etc. In the same or other embodiments, the framesystem includes, without limitation, any number and/or types of frames(not shown in FIG. 1), where each of the frames resists both verticaland lateral loads. In some embodiments, each of the frames includes,without limitation, any number and/or types of beams and any numberand/or types of columns that are interconnected via moment-resistingjoints. In some embodiments, to specify a frame system, a designincludes, without limitation, any number of frame specifications (notshown in FIG. 1), where each of the frame specifications specifies adifferent frame in the frame system.

Because the gravity design application 140 does not take any lateralloads (e.g., the building wind loads) into account when generating thegravity designs 148, the gravity designs 148 do not necessarily includeframe system specifications. The gravity design objective values146(1)-146(N) are objective values for the gravity designs148(1)-148(N), respectively. The gravity design application 140 cangenerate the gravity design 148 in any technically feasible fashion.

As described in greater detail below in conjunction with FIG. 2, in someembodiments, the gravity design application 140 implements abranch-merge design flow to generate the gravity designs 148. During abranching phase, the gravity design application 140 partitions eachfloor of the structural system into multiple segments (not shown in FIG.1). In some embodiments, the gravity design application 140 implements arule-based expert system to generate multiple segments layouts (notshown in FIG. 1) for each of the segments. In the same or otherembodiments, the rule-based expert system is based on domain knowledge.For explanatory purposes only, rules included in rule-based expertsystems that are based on domain knowledge are also referred to hereinas “domain knowledge-based rules.” Each of the segment layoutsspecifies, without limitation, locations, types, and materials for anynumber of slabs, any number of beams, and any number of columns.

In some embodiments, the gravity design application 140 independentlyinitializes and optimizes sizing data for each of the segment layouts togenerate optimized segment designs (not shown in FIG. 1). Prior tooptimizing the sizing data, the gravity design application 140 candetermine any amount (including none) and/or types of relevant data inany technically feasible fashion. For instance, in some embodiments, thegravity design application 140 determines the slab spanning type (e.g.,one-way spanning, two-way spanning, cantilever, etc.) using domainknowledge-based rules. In the same or other embodiments, the gravitydesign application 140 selects any number of continuous beam systems(e.g., groupings of multiple aligned edges) to be treated as a singlebeam using domain knowledge-based rules. To optimize the sizing data fora given segment design, the gravity design application 140 sequentiallyoptimizes the sizing data for the constituent slabs, beams, and columnsbased on the constraints 132 and the objective function 134 while takinginto account gravity but not the building wind load(s). The gravitydesign application 140 also computes objective values for the optimizedsegment designs.

During a merging phase, in some embodiments, the gravity designapplication 140 generates multiple optimized floor designs (not shown)for each floor. To generate the optimized floor designs for a givenfloor, the gravity design application 140 performs per-segment,incremental merging based on the optimized segment designs and theassociated objective values. After each incremental merge, the gravitydesign application optimizes the sizing data for the merged designs (notshown) and computes the associated objective value.

In some embodiments, the gravity design application 140 determinesdifferent combinations of the optimized floor designs to generate thegravity designs 148. The gravity design application 140 can determinethe different combinations of the optimized floor designs in anytechnically feasible fashion. In some embodiments, the gravity designapplication 140 implements a genetic algorithm to combine the optimizedfloor designs based on the associated objective values to generate thegravity designs 148. For instance, some embodiments, the gravity designapplication 140 executes the genetic algorithm on an objective valueassociated with a first set of values specifying one combination of theoptimized floor designs to determine a second set of values specifyinganother combination of the optimized floor designs that is moreconvergent with respect to the design objectives. The gravity designapplication 140 then computes the gravity design objective values146(1)-146(N) based on the objective function 134 and the gravitydesigns 148(1)-148(N), respectively.

Although not shown, in some embodiments, the structural designapplication 120 does not necessarily solve the frame grid optimizationproblem and/or the frame optimization problem. The structural designapplication can determine whether to solve the frame grid optimizationproblem and/or the frame optimization problem in any technicallyfeasible fashion. In some embodiments, the structural design application120 solves the frame grid optimization problem and the frameoptimization problem by default. In the same or other embodiments, ifthe design instructions 130 include the pre-defined column grid, thenthe structural design application 120 does not solve the frame gridoptimization problem. Instead, the structural design application 120uses the pre-defined column grid lines to determine one or more framegrids instead of solving the frame grid optimization problem, and thetechniques described herein are modified accordingly.

As persons skilled in the art will recognize, the beams and columns in areinforced concrete frame structural system are typically connected viarigid joints and therefore the frame system is inherently defined. Forthis reason, in some embodiments, if the gravity designs 148 specifyreinforced concrete frame structural systems, then the structural designapplication 120 solves neither the frame grid optimization problem northe frame optimization problem. Instead, the structural designapplication configures the iterative sizing application 180 to generateframe specifications specifying frames at all possible locations whilesolving the vertical and lateral load design optimization problem. Thetechniques described herein are modified accordingly.

As shown, in some embodiments, the structural design application 120configures the grid generation application 150 to solve the frame gridoptimization problem. More specifically, in some embodiments, thestructural design application 120 configures the grid generationapplication 150 to generate frame grids 158(1)-158(M), where M can beany positive integer, based on the gravity designs 148(1)-148(N) andoptionally the gravity design objective values 146(1)-146(N) and/or anyamount of the parameter data 138. In some embodiments, each of the framegrids 158(1)-158(N) is associated with each floor of the building. Insome other embodiments, different subsets of the frame grids158(1)-158(N) are associated with different subsets of the floors. Forinstance, in some embodiments, some of the frame grids 158(1)-158(N) areassociated with any number of floors that are intended for parking,while the remainder of the frame grids 158(1)-158(N) are associated withany number of floors that are intended for residential use.

Each of the frame grids 158(1)-158(N) includes, without limitation, anynumber of sets of grid lines (not shown), where each set of grid linesis associated with a different direction. Together, the grid linesspecify the allowed locations of the frames of the structural system ofthe building. For explanatory purposes only, the frame grids158(1)-158(M) are also referred to herein individually as “the framegrid 158” and collectively as “the frame grids 158.”

As described in greater detail below in conjunction with FIG. 4, in someembodiments, the grid generation application 150 implements any numberand/or types of unsupervised clustering techniques to generate the framegrids 158. In some embodiments, the grid generation application 150determines an edge set (not shown in FIG. 1) based on the gravitydesigns 148. The edge set includes, without limitation, any number ofedges (not shown), where each edge corresponds to a beam that isconnected to at least one column. In some embodiments, the gridgeneration application 150 generates a different group of edges for eachof the gravity designs 148 and then determines the edge set based on aunion of the groups of edges.

Subsequently, in some embodiments, the grid generation application 150generates a weighted direction set (not shown in FIG. 1) based on thedirections of the edges included in the edge set. The grid generationapplication 150 then applies any number and/or types of unsupervisedclustering techniques to the weighted direction set to generate a basedirection set (not shown in FIG. 1) that includes, without limitation,any number of base directions (not shown in FIG. 1).

In the same or other embodiments, the grid generation application 150generates a weighted equation set (not shown in FIG. 1) based on theequations of the edges included in the edge set and optionally thegravity design objective values 146. For each of the base directions,the grid generation application determines a corresponding weightedequation subset (not shown) of the weighted equation set that includes,without limitation, any number of weighted equations that areapproximately parallel to the base direction.

For each of the weighted equation subsets, the grid generationapplication 150 applies any number and/or types of unsupervisedclustering techniques to the weighted equation subset to determine anynumber of sets of grid lines in the associated base direction. Based onthe sets of grid lines for the base directions, the grid generationapplication 150 generates the frame grids 158. In some embodiments, eachof the frame grids 158 includes a different combination of sets of gridlines for each of the base directions.

In some embodiments, the structural design application 120 generatesconfigurations 168(1)-168(Z) based on the gravity designs 148(1)-148(N)and the frame grids 158(1)-158(M), where Z can be any positive integer.As shown, in some embodiments, the configuration 168(1) includes,without limitation, the gravity design 148(1), the frame grid 158(1),the building wind load data 162, and the design instructions 130. Asalso shown, in some embodiments, the configuration 168(Z) includes,without limitation, the gravity design 148(N), the frame grid 158(M),the building wind load data 162, and the design instructions 130. Ingeneral, each of the configurations 168(1)-168(N) represents a differentcombination of the gravity designs 148(1)-148(N) and the frame grids158(1)-158(M). The structural design application 120 can generate theconfigurations 168(1)-168(Z) in any technically feasible fashion. Forinstance, in some embodiments, the structural design application 120generates exhaustive combinations of the gravity designs 148(1)-148(N)and the frame grids 158(1)-158(M) and therefore Z is equal to theproduct of N and M. In some other embodiments, the structural designapplication 120 generates exhaustive combinations of the best X of thegravity designs 148(1)-148(N) and the best X of the frame grids158(1)-158(M) and therefore Z is equal to the square of X, where X canbe any integer (e.g., X can be N).

In some embodiments, the structural design application 120 configuresthe iterative optimization application 172 to iteratively andcollaboratively solve the frame system optimization problem and thevertical and lateral load design optimization problem independently foreach of the configurations 168(1)-168(Z). More specifically, in someembodiments, the structural design application 120 can configure anynumber of instances of the iterative optimization application 172 togenerate the structural designs 188(1)-188(Z) and the building objectivevalues 186(1)-186(Z) based on the configurations 168(1)-168(Z)sequentially, concurrently, or in any combination thereof.

As shown, in some embodiments, the structural design application 120configures the iterative optimization applications 172(1)-172(Z) toindependently generate the structural designs 188(1)-188(Z),respectively, and the building objective values 186(1)-186(Z),respectively, based on the configurations 168(1)-168(Z), respectively.In some other embodiments, the structural design application 120configures a single instance of the iterative optimization application172 to sequentially generate the structural designs 188(1)-188(Z) andthe building objective values 186(1)-186(Z). For explanatory purposesonly, instances of the iterative optimization application 172 are alsoreferred to herein individually as “the iterative optimizationapplication 172” and collectively as “the iterative optimizationapplications 172.”

The structural designs 188(1)-188(Z) are designs for the structuralsystem of the building that the iterative optimization application 172optimizes based on the objective function 134 and the constraints 132while taking into account gravity and the building wind load(s). Forexplanatory purposes only, the structural designs 188(1)-188(Z) are alsoreferred to herein individually as “the structural design 188” andcollectively as “the structural designs 188.” The building objectivevalues 186(1)-186(Z) are objective values of the structural designs188(1)-188(Z), respectively. For explanatory purposes only, the buildingobjective values 186(1)-186(Z) are also referred to herein individuallyas “the building objective value 186” and collectively as “the buildingobjective values 186.”

In some embodiments, each instance of the iterative optimizationapplication 172 includes, without limitation, a different instance ofthe frame specification application 170 and a different instance of theiterative sizing application 180. In operation, the iterativeoptimization application 172 orchestrates any number of designoptimization iterations via the frame specification application 170 andthe iterative sizing application 180. The frame specificationapplication 170 is described in greater detail below in conjunction withFIG. 5. The iterative sizing application 180 is described in greaterdetail below in conjunction with FIG. 6. For explanatory purposes only,the functionality of the iterative optimization application 172 isdescribed in conjunction with FIG. 1 in the context of the iterativeoptimization application 172(1) that generates the structural design188(1) and the building objective value 186(1) based on theconfiguration 168(1).

In some embodiments, to initiate a first design optimization iteration,the iterative optimization application 172(1) inputs the gravity design148(1), the frame grid 158(1), and the wind directions 164 into theframe specification application 170. In response, the framespecification application 170 determines a different potential framelocation set (not shown in FIG. 1) for each of the wind directions 164based on the gravity design 148(1) and the frame grid 158(1). For eachof the wind directions 164, the frame specification application 170bifurcates the associated potential frame location set into a left framegroup (not shown in FIG. 1) and a right frame group (not shown inFIG. 1) based on a building load centroid (not shown in FIG. 1).

In some embodiments, the frame specification application 170 configuresa genetic algorithm (not shown in FIG. 1) to iteratively andcollectively optimize left frame counts (not shown in FIG. 1) and rightframe counts (not shown in FIG. 1) for the left frame groups and theright frame groups, respectively, based on the building objective value186(1) associated with the prior design optimization iteration (if any).For the first design optimization iteration, in some embodiments, thegenetic algorithm randomly determines the left frame counts and theright frame counts. As described in greater detail below, the iterativesizing application 180 generates the structural design 188(1) andcomputes the building objective value 186(1) to complete each designoptimization iteration.

For each of the left frame groups, the frame specification application170 selects the associated left frame count of locations from the leftframe group in order of decreasing distance from the building loadcentroid. Similarly, for each of the right frame groups, the framespecification application 170 selects the associated right frame countof locations from the right frame group in order of decreasing distancefrom the building load centroid. The frame specification application 170then generates a frame system specification 178(1) based on the selectedlocations. In some embodiments, for each of the selected locations, theframe system specification 178(1) specifies, without limitation, thatthe structural members included in the gravity design 148(1) that areassociated with the selected location are to be interconnected viamoment-resisting joints.

To initiate each subsequent design optimization iteration, the iterativeoptimization application 172(1) inputs the building objective value186(1) generated by the iterative sizing application 180 during theprior design optimization iteration into the frame specificationapplication 170. In response, the frame specification application 170inputs the building objective value 186(1) into the genetic algorithm.The genetic algorithm re-determines the left frame counts and the rightframe counts. Subsequently, the frame specification application 170re-generates the frame system specification 178(1) based on there-determined left frame counts and the re-determined right framecounts.

In some other embodiments, the frame specification application 170 doesnot bifurcate the potential frame location sets into the left framegroups and the right frame groups. Instead, the frame specificationapplication 180 configures the genetic algorithm to iteratively andcollectively optimize Boolean values for each of the potential framelocations across the potential frame locations sets based on thebuilding objective value 186(1) associated with the prior designoptimization iteration (if any). During each design optimizationiteration, after using the genetic algorithm to determine the Booleanvalues for the potential frame locations, the frame specificationapplication 170 selects the locations from the potential frame locationsets for which the corresponding Boolean values are true. Subsequently,the frame specification application 170 generates the frame systemspecification 178(1) for the frame system that specifies, withoutlimitation, a different frame at each of the selected locations.

To complete each design optimization iteration (including the firstdesign optimization iteration), the iterative optimization application172(1) inputs the frame system specification 178(1), the gravity design148(1), the design instructions 130, and the building wind load data 162into the iterative sizing application 180. In response, in someembodiments, the iterative sizing application 180 adds framespecifications as per the frame system specification 178(1) to thegravity design 148(1) to generate a current structural design (notshown). In this fashion, the current structural design specifies a framesystem that includes, without limitation, any number of frames.

In some embodiments, the iterative sizing application 180 defines anditeratively solves a nested optimization problem to optimize the sizingof the beams and the columns included in the current structural designbased on the constraints 132 and the objective function 134 while takinginto account gravity and the building wind load(s). To initiate each toplevel iteration of the nested optimization problem, the iterative sizingapplication 180 iteratively optimizes the sizing data for the columnsbased on the constraints 132 and the objective function 134, updatingthe dead loads after each iteration while keeping the wind loads of thestructural members fixed. The iterative sizing application 180 theniteratively executes any number of middle level iterations.

To initiate each middle level iteration, the iterative sizingapplication 180 distributes the building wind load(s) across the framescorresponding to the frame specifications of the current structuraldesign to generate fixed lateral load(s) for each of the frames. Foreach of the frames, the iterative sizing application 180 initiates anynumber of bottom level iterations. During each bottom level iterationfor a given frame, the iterative sizing application 180 iterativelyoptimizes the sizing of the columns and the beams in the frame based onthe fixed lateral load(s) associated with the frame. Notably, duringeach bottom level iteration, the iterative sizing application 180iteratively re-distributes the fixed lateral load(s) across thestructural elements within the associated frame.

After the iterative sizing application 180 solves the nestedoptimization problem, the iterative sizing application 180 sets thestructural design 188(1,1) equal to the current structural design. Theiterative sizing application 180 then computes the building objectivevalue 186(1) based on the structural design 188(1) and the objectivefunction 134.

The iterative optimization application 172(1) then determines whether toinitiate another design optimization iteration. The iterativeoptimization application 172(1) can determine whether to initiateanother design optimization iteration in any technically feasiblefashion. In some embodiments, the iterative optimization application172(1) determines whether to imitate another design optimizationiteration based on any number and/or types of completion criteriaspecified via the parameter data 138. In some embodiments, if theiterative optimization application 172(1) determines to initiate anotherdesign optimization iteration, then the iterative optimizationapplication 172(1) inputs the building objective value 186(1) into theframe specification application 170. Otherwise, the iterativeoptimization application 172(1) transmits the structural design 188(1)and the building objective value 186(1) to the overall ranking engine190.

In some embodiments, after the overall ranking engine 190 receives thestructural designs 188(1)-188(Z) and the building objective values186(1)-186(Z), the overall ranking engine 190 generates a rankedstructural design list 198. The ranked structural design list 198includes, without limitation, the structural designs 188 and thebuilding objective values 186 associated with the structural designs188. In some embodiments, the overall ranking engine 190 specifiesstructural designs 188 in the ranked structural design list 198 in orderof decreasing convergence with the design objectives as per the buildingobjective values 186.

As shown, in some embodiments, the overall ranking engine 190 transmitsthe ranked structural design list 198 to the interface engine 108 fordisplay via the GUI 106. In the same or other embodiments, thestructural design application 120 stores any portions (including none orall) of the ranked structural design list 198 and/or any number ofsolutions of any number of the constituent optimization problems in anymemory that is available to at least one other software application. Insome embodiments, the structural design application 120 transmits anyportions (including none or all) of the ranked structural design list198 and/or any number of solutions of any number of the constituentoptimization problems to any number of other software applications inany technically feasible fashion.

In some embodiments, the structural design application 120, the gravitydesign application 140, the grid generation application 150, theiterative optimization application 172, the frame specificationapplication 170, the iterative sizing application 180, or anycombination thereof use any number and/or types of trained machinelearning models to design, optimize, and/or analyze any number and/ortypes of structural elements, layouts, designs, frame systems, frames,or any combination thereof. In the same or other embodiments, thestructural design application 120, the gravity design application 140,the grid generation application 150, the iterative optimizationapplication 172, the frame specification application 170, the iterativesizing application 180, or any combination thereof store any amount oftraining data for use in training and/or re-training any number and/ortypes of machine learning models.

Notably, in some embodiments, the structural design application 120, thegravity design application 140, the grid generation application 150, theiterative optimization application 172, the frame specificationapplication 170, the iterative sizing application 180, or anycombination thereof apply any number and/or type of design and/orstructural engineering fundamentals to design, optimize, and/or analyzeany number and/or types of structural elements, layouts, designs, framesystems, frames, or any combination thereof.

Some examples of design and structural engineering fundamentals include,without limitation, the compatibility of displacement concept,structural idealization, the principle of superposition, the portalmethod, and the method of sections. For instance, in some embodiments,the structural design application 120, the gravity design application140, and the iterative sizing application 180 generate idealizedstructures for slabs, beams, columns, frames, and/or frame systems tosimplify the analysis and/or design of different portions (includingall) of the structural system.

Advantageously, incorporating any amount (including all) of thefunctionality described herein in the context of the structural designapplication 120, the gravity design application 140, the grid generationapplication 150, the iterative optimization application 172, the framespecification application 170, and the iterative sizing application 180into a CAD application can increase the likelihood that the CADapplication can generate an optimized design for the structural systemthat is convergent with the design objectives. In that regard, usingtrained machine learning models and/or design and structural enginefundamentals to evaluate design decisions can substantially reduce thetime required to optimize designs relative to prior art techniques thatuse finite element analysis to evaluate designs manually created basedon designer intuition. Furthermore, relative to conventional CADapplications, because the structural design application 120 decomposesthe overall optimization design problem into multiple constituentoptimization problems, the structural design application 120 can moreefficiently and systematically explore the design space of thestructural system. In the same or other embodiments, because any numberof the interface engine 108, the gravity design application 140, thegrid generation application 150, the frame specification application170, and the iterative sizing application 180 can be configured toretain only the best solutions, the design space of the structuralsystem can be explored in a more directed and therefore efficientfashion.

Note that the techniques described herein are illustrative rather thanrestrictive and can be altered without departing from the broader spiritand scope of the invention. Many modifications and variations on thefunctionality provided by the structural design application 120, theinterface engine 108, the gravity design application 140, the gridgeneration application 150, the iterative optimization application 172,the frame specification application 170, the iterative sizingapplication 180, and the overall ranking engine 190 will be apparent tothose of ordinary skill in the art without departing from the scope andspirit of the described embodiments. For instance, in some embodiments,the functionality of any number of the structural design application120, the grid generation application 150, the iterative optimizationapplication 172, the frame specification application 170, and theiterative sizing application 180 can be modified to perform optimizationoperations based on any number and/or types of lateral loads in additionor instead of the building wind load(s).

It will be appreciated that the system 100 shown herein is illustrativeand that variations and modifications are possible. For example, thefunctionality provided by the structural design application 120, theinterface engine 108, the gravity design application 140, the gridgeneration application 150, the iterative optimization application 172,the frame specification application 170, the iterative sizingapplication 180, and the overall ranking engine 190 as described hereinmay be integrated into or distributed across any number of softwareapplications (including one), and any number of components of the system100. Further, the connection topology between the various units in FIG.1 can be modified as desired.

In some embodiments, any number of the gravity design application 140,the grid generation application 150, the iterative optimizationapplication 172, the frame specification application 170, and theiterative sizing application 180 can be executed in a stand-alonefashion by any number of software applications and/or users in anytechnically feasible fashion.

Generating Gravity Designs Via a Branch-Merge Design Flow

FIG. 2 is a more detailed illustration of the gravity design application140 of FIG. 1, according to various embodiments. As described previouslyherein in conjunction with FIG. 1, the gravity design application 140solves the layout and gravity design optimization problem. In someembodiments, to solve the layout and gravity design optimizationproblem, the gravity design application 140 generates the gravitydesigns 148 and the gravity design objective values 146 based on thebuilding plan 124 and the design instructions 130.

As described previously herein in conjunction with FIG. 1, each of thegravity designs 148 is a different design for the structural system thatis optimized based on the constraints 132 and the objective function 134without taking into account the building wind load(s). In someembodiments, the gravity design application 140 implements abranch-merge design flow to generate the gravity designs 148. In thesame or other embodiments, the gravity design application 140 includes,without limitation, a design concept engine 220, any number of instancesof a floor design engine 210 (not explicitly shown), and a multi-flooroptimizer 290.

In some embodiments, the design concept engine 220 branches the layoutand gravity design optimization problem into a different flooroptimization problem for each of the floors of the building. As shown,in some embodiments, the design concept engine 220 generates floorstructure templates 222(1)-222(F) based on the floor outlines128(1)-128(F), respectively, and the design instructions 130. Forexplanatory purposes only, the floor structure templates 222(1)-222(F)are also referred to herein individually as “the floor structuretemplate 222” and collectively as “the floor structure templates 222.”

Each of the floor structure templates 222 is a template for layouts of aportion of the structural system corresponding to a different floor. Theportions of the structural system corresponding to each of the floors inthe building are also referred to herein individually as a “floorstructure” and collectively as “floor structures.” In some embodiments,each layout of a given floor structure includes, without limitation, anynumber and/or types of horizontal structural members associated with thecorresponding floor and any number and/or types of vertical structuralmembers that are designed as part of the floor structure. In the same orother embodiments, the vertical structural members that are designed aspart of a given floor structure include, without limitation, any numberand/or type of vertical members that extend down from the floor to animmediately lower floor (if one exists) or a foundation. In someembodiments, each layout of a given floor structure specifies, withoutlimitation, locations, types, and materials for a slab, any number ofbeams, and any number of columns.

The design concept engine 220 can generate the floor structure templates222 in any technically feasible fashion. In some embodiments, the designconcept engine 220 generates the floor structure templates 222(1)-222(W)that each specify, without limitation, a slab (not shown) that ischaracterized by a slab material/type (not shown) and has a locationthat specifies dimensions associated with the dimensions of the flooroutlines 128(1)-128(W), respectively. In the same or other embodiments,horizontal cross-sections of the slabs specified in the floor structuretemplates 222(1)-222(W) match the floor outlines 128(1)-128(W),respectively.

One example of a slab material/type is a two-way reinforced concreteslab with reinforced concrete beams that is constructed using squarepanels having an aspect ratio of 1.0. Another example of a slabmaterial/type is a precast hollow core slab with precast beams that isconstructed using rectangular panels having an aspect ratio of 1.25. Yetanother example of a slab material/type is post-tensioned flat slab thatis constructed using rectangular panels having an aspect ratio of 1.5.The design concept engine 220 can determine the slab material/type inany technically feasible fashion.

In some embodiments, the slab material/type is specified in the designinstructions 130. In some other embodiments, the design concept engine220 implements any number of expert system techniques to determine theslab material/type. For instance, in some embodiments, the designconcept engine 220 determines the slab material/type based on thedimensions of the floor outlines 128, the constraints 132, the objectivefunction 134, the design variable data 136, or any combination thereofbased on one or more rules included in a knowledge base (not shown).

In some embodiments, the design concept engine 220 configures the floordesign engine 210 to solve the floor optimization problem for each ofthe floor structures independently. More precisely, the design conceptengine 220 configures the floor design engine 210 to generate rankedfloor design lists 288(1)-288(F) based on the floor structure templates222 (1)-222(F), respectively, and the design instructions 130. Forexplanatory purposes only, the ranked floor design lists 288(1)-288(F)are also referred to herein individually as “the ranked floor designlist 288” and collectively as “the ranked floor design lists 288.”

Although not shown, each of the ranked floor design lists 288 isassociated with a different floor structure and specifies, withoutlimitation, any number of instances of an optimized partial design 268(not explicitly shown in FIG. 2) and corresponding instances of apartial objective value 266 (not explicitly shown in FIG. 2). Forexplanatory purposes only, instances of the optimized partial design 268are also referred to herein individually as “the optimized partialdesign 268” and collectively as “the optimized partial designs 268.”Further, instances of the partial objective value 266 are also referredto herein individually as “the partial objective value 266” andcollectively as “the partial objective values 266.”

Each of the optimized partial designs 268 is a design for at least aportion of the structural system and specifies, without limitation,sizing data of the constituent structural members that is optimizedbased on the constraints 132 and the objective function 134 withouttaking lateral loads into account. Each of the partial objective values266 corresponds to different one of the optimized partial designs 268and is a value of the objective function 134 for the optimized partialdesign 268.

Each of the optimized partial designs 268 that is included in the rankedfloor design list 288 associated with a given floor structure is adifferent design for the floor structure. For explanatory purposes only,the optimized partial designs 268 that correspond to a given floorstructure are also referred to herein individually as “the optimizedpartial design 286 of the floor structure” and collectively as “theoptimized partial designs 268 of the floor structure.”

The design concept engine 220 can configure any number of instances ofthe floor design engine 210 to generate the ranked floor design lists288(1)-288(F) sequentially, concurrently, or in any combination thereofin any technically feasible fashion. For explanatory purposes only,instances of the floor design engine 210 are also referred to hereinindividually as “the floor design engine 210” and collectively as “thefloor design engines 210.”

As shown, in some embodiments, the gravity design application 140configures the floor design engines 210(1)-210(F) to concurrentlygenerate the ranked floor design lists 288(1)-288(F), respectively,based on the floor structure templates 222(1)-222(F), respectively, andthe design instructions 130. In some other embodiments, the designconcept engine 220 configures a single instance of the floor designengine 210 to sequentially generate the ranked floor design lists288(1)-288(F).

The floor design engine 210 can generate the ranked floor design list288 for a given floor structure based on the floor structure template222 for the floor structure and the design instructions 130 in anytechnically feasible fashion. For explanatory purposes only, thefunctionality of the floor design engine 210 in some embodiments isdescribed in greater detail below in the context of the floor designengine 210(1) depicted in FIG. 2 that generates the ranked floor designlist 288(1) based on the floor structure template 222(1) and the designinstructions 130. For explanatory purposes only, the floor structuretemplate 222(1) and the floor structure template 222(1) are bothassociated with a first floor structure.

In some embodiments, the floor design engine 210(1) includes, withoutlimitation, a partitioning engine 224, any number of instances of asegment design engine 240 (not explicitly shown), and an incrementalmerging engine 280. The partitioning engine 224 branches the flooroptimization problem associated with a given floor structure intomultiple different segment optimization problems. In some embodiments,the partitioning engine 224 can branch each of the floor optimizationproblems into a different number of segment optimization problems.

In some embodiments, for each of the floor structures, each of thesegment optimization problems is associated with a different portion ofthe floor structure that is represented as a different instance of asegment 230 (not explicitly shown). For explanatory purposes only,instances of the segments 230 are also referred to herein individuallyas “the segment 230” and collectively as “the segments 230.” Thepartitioning engine 224 can generate the segments 230 associated with agiven floor structure in any technically feasible fashion.

As shown, in some embodiments, the partitioning engine 224 generates thesegments 230(1)-230(S) based on the floor structure template 222(1) andthe design instructions 130, where S can be any positive integer. In thesame or other embodiments, each of the segments 230(1)-230(S) associatedwith the floor structure template 222(1) is associated with a differentportion of the slab specified in the floor structure template 222(1). Insome embodiments, the partitioning engine 224 determines the value of Sprior to generating the segments 230(1)-230(S). For instance, in someembodiments, the partitioning engine 224 sets S equal to the maximumvariation count (denoted as N) that is specified in the parameter data138. In some other embodiments, the value of S is defined indirectly bythe number of the segments 230 that the partitioning engine 224generates based on the floor structure template 222(1).

In some embodiments, the partitioning engine 224 implements a rule-basedexpert system to partition the floor structure template 222(1) into thesegments 230(1)-230(S) based on any amount and/or type of data includedin the design instructions 130. In the same or other embodiments, thepartitioning engine 224(1) partitions the floor structure template222(1) into the segments 230(1)-230(S) based, at least in part, on theshape of the floor structure template 222 and/or the associated slabmaterial/type.

For instance, in some embodiments, if the floor is U-shaped, then thepartitioning engine 224 partitions the floor structure template 222 intoat least one or more east wings, one or more central wings, and one ormore west wings. In the same or other embodiments, if the slabmaterial/type corresponding to the floor structure template 222specifies that the slab is constructed of panels, then the partitioningengine 224 partitions the floor structure template 222 into the segments230(1)-230(S) based, at least in part, on the dimensions of each of thepanels.

The partitioning engine 224 configures the segment design engine 240 toindependently solve the segment optimization problem for each of thesegments 230(1)-230(S). In some embodiments, to solve the segmentoptimization problems for the segments 230(1)-230(S), the partitioningengine 224 configures the segment design engine 240 to generate rankedsegment design lists 278(1)-278(S) based on the segments 230(1)-230(S)respectively, and the design instructions 130.

The ranked segment design lists 278(1)-278(S) are a subset of instancesof the ranked segment design list 278 (not explicitly shown) that areassociated with the floor structure template 222(1). In general, eachinstance of the segment design list 278 is associated with a differentinstance of the segment 230. For explanatory purposes only, theinstances of the ranked segment design list 278 are also referred toherein individually as “the ranked segment design list 278” andcollectively as “the ranked segment design lists 278.” Although notshown, each of the ranked segment design lists 278 specifies, withoutlimitation, any number of the optimized partial designs 268 of theassociated segment 230 and the corresponding instances of the partialobjective value 266.

The partitioning engine 224 can configure any number of instances of thesegment design engine 240 to generate the ranked segment design lists278(1)-278(S) sequentially, concurrently, or in any combination thereofin any technically feasible fashion. For explanatory purposes only,instances of the segment design engine 240 are also referred to hereinindividually as “the segment design engine 240” and collectively as “thesegment design engines 240.”

As shown, in some embodiments, the partitioning engine 224(1) configuresthe segment design engines 240(1)-240(S) to concurrently generate theranked segment design lists 278(1)-278(S), respectively, based on thesegments 230(1)-230(S), respectively, and the design instructions 130.In some other embodiments, the partitioning engine 224(1) configures asingle instance of the segment design engine 240 to sequentiallygenerate the ranked segment design lists 278(1)-278(S).

The segment design engine 240 can generate each of the ranked segmentdesign lists 278 in any technically feasible fashion. For explanatorypurposes only, the functionality of the segment design engine 240 insome embodiments is described in greater detail below in the context ofthe segment design engine 240(1) depicted in FIG. 2 that generates theranked segment design list 278(1) based on the segment 230(1) and thedesign instructions 130. As shown, in some embodiments, the segmentdesign engine 240 includes, without limitation, a layout variationengine 250, any number of instances of a gravity design optimizer 260,and a segment design ranking engine 270.

In some embodiments, the layout variation engine 250 generates partialdesign 258(1)-258(K) based on the segment 230(1) and the designinstructions 130, where K can be any positive integer. The partialdesigns 258(1)-258(K) are a subset of instances of a partial design 258(not explicitly shown in FIG. 2) that are associated with the segment230(1). In some embodiments, the layout variation engine 250 cangenerate a different number of instances of the partial designs 258 foreach of the segments 230.

For explanatory purposes only, instances of the partial design 258 arealso referred to herein individually as “the partial design 258” andcollectively as “the partial designs 258.” Each of the partial designs258 is a design for at least a portion of the structural system. Foreach of the segments 230, the partial designs 258 that are generated bythe layout variation engine 250 based on the segment 230 are differentdesigns of the segment 230 and are also referred to herein as “thepartial designs 258 of the segment 230.”

The layout variation engine 250 can determine the value of K in anytechnically feasible fashion. For instance, in some embodiments, thelayout variation engine 250 sets K equal to the maximum variation count(denoted as N) that is specified in the parameter data 138. In someother embodiments, the value of K is defined indirectly by the number ofthe partial designs 258 that the layout variation engine 250 generatesfor the segment 230(1). The layout variation engine 250 can generate anynumber of the partial designs 258 for each of the segments 230 in anytechnically feasible fashion.

In some embodiments, the layout variation engine 250 includes, withoutlimitation, any number of instances of a segment layout 252 (notexplicitly shown), and the layout variation engine 250 generates thepartial designs 258 of the segment 230 based on the instances of thesegment layout 252 For explanatory purposes only, instances of thesegment layout 252 are also referred to herein individually as “thesegment layout 252” and collectively as “the segment layouts 252.” Eachof the segment layouts 252 is a layout of one of the segments 230. Eachof the segment layouts 252 generated by the layout variation engine 250based on the segment 230 is a different layout of the segment 230. Thelayout variation engine 250 can generate the segment layouts 252 in anytechnically feasible fashion.

In some embodiments, the layout variation engine 250 implements anynumber and/or types of expert system techniques to generate any numberof the segment layouts 252 based on the segment 230 and optionally anyamount (including none) of the design instructions 130. For instance, insone embodiments, the layout variation engine 250 generates any numberof the segments layouts 252 based on the segment 230, any number ofrules included in a knowledge database (not shown), and any amount(including none) of the design instructions 130.

In the same or other embodiments, the layout variation engine 250 uses a“filtering” trained machine learning model to predict which (if any) ofthe segment layouts 252 are subpar. The layout variation engine 250 thendiscards any of the segment layouts 252 that are predicted to be subpar.In some embodiments, the layout variation engine 250 and/or the gravitydesign application 140 store any amount and/or types of training datafor use in re-training the filtering trained machine learning model.

For explanatory purposes only, in some embodiments, the layout variationengine 250 generates and does not subsequently discard, the segmentlayouts 252(1)-252(K) based on the segment 230(1). The layout variationengine 250 initializes each of the partial designs 258(1)-258(K) to anempty design. The layout variation engine 250 then copies the segmentlayouts 252(1)-252(K) to the partial designs 258(1)-258(K),respectively. In some embodiments, the layout variation engine 250specifies defaults for any amount and/or type of sizing data and/or anyamount and/or types of connection data in the segment layouts 252. Forinstance, in some embodiments, the layout variation engine 250 specifiesthat each of the connections between the structural members of each ofthe partial designs 258 is a rigid joint. In some other embodiments, foreach of the partial designs 258, the layout variation engine 250specifies that each of the connections that are on the outer perimeterof the building is a rigid joint and that other connections are hingedjoints or pin joints.

As shown, in some embodiments, the layout variation engine 250configures the gravity design optimizer 260 to generate the optimizedpartial designs 268(1)-268(K) and the partial objective values266(1)-266(K) based on the partial designs 258(1)-258(K) and the designinstructions 130. The layout variation engine 250 can configure anynumber of instances of the gravity design optimizer 260 to generate theoptimized partial design 268(1)-268(K) and the partial objective values266(1)-266(K) sequentially, concurrently, or in any combination thereofin any technically feasible fashion. For explanatory purposes only,instances of the gravity design optimizer 260 are also referred toherein individually as “the gravity design optimizer 260” andcollectively as “the gravity design optimizers 260.”

As shown, in some embodiments, the layout variation engine 250configures the gravity design optimizers 260(1)-260(K) to concurrentlygenerate the optimized partial design 268(1)-268(K), respectively, andthe partial objective values 266(1)-266(K), respectively, based on thepartial designs 258(1)-258(K), respectively, and the design instructions130. In some other embodiments, the layout variation engine 250configures a single instance of the gravity design optimizer 260 tosequentially generate the optimized partial design 268(1)-268(K) and thepartial objective values 266(1)-266(K),

The gravity design optimizer 260 can perform any number and/or types ofoptimization operations on the sizing of the structural componentsincluded in the partial design 258 to generate the optimized partialdesign 268. As described in greater detail below in conjunction withFIG. 3, in some embodiments, the gravity design optimizer 260sequentially optimizes the sizing of the slab, the beams, and thecolumns included in the partial design 258 to generate the optimizedpartial design 268.

As shown, in some embodiments, the segment design ranking engine 270generates the ranked segment design list 278(1) based on the optimizedpartial designs 268(1)-268(K) and the partial objective values266(1)-266(K). The segment design ranking engine 270 can generate theranked segment design list 278(1) in any technically feasible fashion.For instance, in some embodiments, the segment design ranking engine 270ranks the optimized partial designs 268(1)-268(K) based on the partialobjective values 266(1)-266(K).

In some embodiments, the segment design ranking engine 270 filters outany number of the optimized partial designs 268(1)-268(K) whengenerating the ranked segment design list 278(1) based on any numberand/or type of filtering criteria. Consequently, in such embodiments,the total number of the optimized partial designs 268 specified in theranked segment design list 278(1) is less than K. The optimized partialdesigns 268(1)-268(K) are also referred to herein as “potential segmentdesigns,” and the optimized partial designs 268 specified in the rankedsegment design list 178(1) are also referred to herein as “segmentdesigns.” For instance, in some embodiments, the filtering criteria isto specify the N best of the partial objective values 266(1)-266(K) andthe associated optimized partial designs 268(1)-268(K) via the rankedsegment design list 278(1), where N is the maximum variation count. Thesegment design ranking engine 270 discards the remainder of the partialobjective values 266(1)-266(K) and the associated optimized partialdesigns 268(1)-268(K).

In some embodiments, for each of the floors, the floor design engine 210configures the incremental merging engine 280 to generate the rankedfloor design list 288 associated with the floor based on the rankedsegment design lists 278 associated with the floor and the designinstructions 130 In the same or other embodiments, the incrementalmerging engine 280 includes, without limitation, any number of instancesof the gravity design optimizer 260. The incremental merging engine 280can generate the ranked floor design lists 288(1)-288(S) in anytechnically feasible fashion.

In some embodiments, the floor design engine 210(1) configures theincremental merging engine 280 to generate the ranked floor design list288(1) based on the ranked segment design lists 278(1)-278(S) and thedesign instructions 130. Each of the optimized partial designs 268included in the ranked floor design list 288(1) is a design for thefirst floor structure that is optimized based on the constraints 132 andthe objective function 134 without taking into account lateral loads. Insome embodiments, each of the optimized partial designs 268 included inthe ranked floor design list 288(1) is generated based on a differentset of S instances of the optimized partial design 268. Each set of Sinstances includes, without limitation, one of the optimized partialdesigns 268 from each of the ranked segment design lists 278(1)-278(S)associated with the first floor structure.

In some embodiments, the incremental merging engine 280 executes (S−1)different expansion iterations to generate the ranked floor design list288(1). During the first expansion iteration, the incremental mergingengine 280 sets a segment ranking value for each of the segments230(1)-230(S) equal to the best of the partial objective values 266 thatare included in the ranked segment design lists 278(1)-278(S),respectively. The incremental merging engine 280 selects the segment 230having the worst segment ranking value from the segments 230(1)-230(S)as a first merge participant. In some embodiments, the structural designapplication 120 attempts to maximize the objective function 134, and theworst segment ranking value is the lowest of the segment ranking values.In some other embodiments, the structural design application 120attempts to minimize the objective function 134, and the worst segmentranking value is the highest of the segment ranking values. Theincremental merging engine 280 then selects the segment having the worstsegment ranking from the subset of the segments 230(1)-230(S) that areadjacent to the first merge participant as a second merge participant.

The incremental merging engine 280 performs any number of mergingoperations between the optimized partial designs 268 of the first mergeparticipant and the optimized partial designs 268 of the second mergeparticipant to generate any number of new instances of the partialdesign 258. Each new instance of the partial design 258 represents bothof the merge participants and is also referred to herein as a “partialfloor design.” The incremental merging engine 280 then configures thegravity design optimizer 260 to generate new instances of the optimizedpartial design 268 and new instances of the partial objective values 266based on the new instances of the partial designs 258 and the designinstructions 130. The incremental merging engine 280 generates a rankedmerged design list (not shown) that includes, without limitation, the Nnew instances of the optimized partial design 268 corresponding to the Nbest new partial objective values.

For each of the subsequent expansion iterations, the incremental mergingengine 280 selects a new merge participant having the worst segmentranking value from the subset of the segments 230(1)-230(S) that areadjacent to one of the previously selected merge participants and havenot yet been selected as a merge participant. The incremental mergingengine 280 then performs any number of merging operations between theoptimized partial designs 268 of the new merge participant and theranked merged design list to generate any number of the new instances ofthe partial design 258. The incremental merging engine 280 re-generatesthe ranked merged design list based on the new instances of the partialdesign 258. After completing the (S−1) expansion iteration, theincremental merging engine 280 sets the ranked floor design list 288(1)equal to the ranked merged design list.

In some other embodiments, the incremental merging engine 280 executesany number and/or type of search algorithms and/or optimizationalgorithms to generate the ranked floor design list 288(1), Forinstance, in some embodiments, the incremental merging engine 280 canexecute any number and/or types of genetic algorithms, any number and/ortypes of harmony search algorithms, any number and/or types of integeroptimization algorithms, the gravity design optimizer 260, or anycombination thereof to generate the ranked floor design list 288(1).

As shown, in some embodiments, the gravity design application 140configures the multi-floor optimization 290 to generate the gravitydesigns 148(1)-148(N) and the gravity design objective values146(1)-146(N) based on the ranked floor design lists 288(1)-288(F). Insome embodiments, the gravity design application 140 generates each ofthe gravity designs 148(1)-148(N) based on a different set of F of theoptimized partial designs 268. Each set of F of the optimized partialdesigns 268 includes, without limitation, one of the optimized partialdesigns 268 from each of the ranked floor design lists 288(1)-288(F).

In some embodiments, the multi-floor optimizer 290 executes any numberand/or types of incremental merging operations and/or aggregationoperations based on the ranked floor design lists 288(1)-288(F) togenerate the gravity designs 148(1)-148(N). In the same or otherembodiments, the multi-floor optimizer 290 executes any number and/ortype of search algorithms in any combination to generate the gravitydesigns 148. For instance, in some embodiments, the multi-flooroptimizer 290 executes any number and/or types of genetic algorithms,any number and/or types of harmony search algorithms, any number and/ortypes of integer optimization algorithms, or any combination thereof togenerate the gravity designs 148.

The multi-floor optimizer 290 compute the gravity design objectivevalues 146(1)-146(N) corresponding to the gravity designs 148(1)-148(N)in any technically feasible fashion. For instance, in some embodiments,the multi-floor optimizer 290 applies the objective function 134 to thegravity designs 148(1)-148(N) to compute the gravity design objectivevalues 146(1)-146(N), respectively. Because the multi-floor optimizer290 merges combinations of the optimized partial designs 268 thatcorrespond to different floor structures, and the optimized partialdesigns 268 are not necessarily optimized for lateral loads, themulti-floor optimizer 290 does not optimize the sizing of any of thestructural members in some embodiments.

In the same or other embodiments, the multi-floor optimizer 290 computesand specifies any number of vertical loads for each of the gravitydesigns 148 based on any number of vertical loads specified in theoptimized partial designs 268 associated with the gravity design 148.For instance, in some embodiments, the multi-floor optimizer 290 sumsthe vertical loads of the optimized partial designs 268 associated withthe gravity design 148 at the interfaces of the columns to determine thecorresponding vertical loads for the gravity design 148. In the same orother embodiments, for the optimized partial design 268 corresponding toa given floor structure, the multi-floor optimizer 390 uses transferbeams when there is no column in the optimized partial design 268corresponding to the floor structure that is one level below the floorstructure. A transfer beam takes the loading from such “orphan” columnsand transfers the load onto one or more existing columns and/or beams inthe optimized partial design 268 corresponding to the floor structurethat is one level below the floor structure.

In some embodiments, the gravity design application 140 transmits anynumber of the gravity designs 148 and/or any number of the gravitydesign objective values 146 to any number of other software applicationsin any technically feasible fashion. In the same or other embodiments,the gravity design application 140 stores any number of the gravitydesigns 148 and/or any number of the gravity design objective values 146in a memory that is accessible to at least one other softwareapplication. In some embodiments, the gravity design application 140stores the gravity designs 148 and the gravity design objective values146 in a memory that is accessible to the structural design application120.

FIG. 3 is a more detailed illustration of the gravity design optimizer260 of FIG. 2, according to various embodiments. As shown, in someembodiments, the gravity design optimizer 260 generates the optimizedpartial design 268 and the partial objective value 266 based on thepartial design 258 and the design instructions 130. As describedpreviously herein in conjunction with FIG. 1, each instance of thepartial design 258 is a design for at least a portion of the structuralsystem. More specifically, in some embodiments, each instance of thepartial design 258 that the gravity design optimizer 260 receives is adesign for at least a portion of one of the floor structures.

As shown, in some embodiments, the gravity design optimizer 260generates a floor design dataset 368 based on the partial design 258. Inthe same or other embodiments, the floor design dataset 368 includes,without limitation, a floor layout 310, floor sizing data 320, floorlive load data 322, and floor dead load data 324. In some embodiments,the floor layout 310 includes, without limitation, slab data 312, a beamlist 314, and a column list 316. The slab data 312 specifies, withoutlimitation, a location, material, and type of a slab (not shown). Thebeam list 314 specifies, without limitation, locations, materials, andtypes of any number of beams (not shown). The column list 316 specifies,without limitation, locations, materials, and types any number ofcolumns (not shown). As depicted in italics, in some embodiments, thefloor layout 310 is fixed.

The floor sizing data 320 specifies, without limitation, any amountand/or types of sizing data for the slab, beams, and columns specifiedin the floor layout 310. In some embodiments, the floor live load data322 includes, without limitation, any number and/or types of live loadsfor each of the rooms included in the floor layout 310. The floor deadload data 324 includes, without limitation, any number and/or types ofdead loads associated with the floor layout 310.

Although not shown, in some embodiments, the floor design dataset 368specifies any number and/or type of default connections between thestructural members specified in the floor layout 310. For instance, insome embodiments, the floor design dataset 368 specifies that each ofthe connections between the structural members specified in the floorlayout 310 is a rigid joint. Notably, the floor design dataset 368 doesnot specify any lateral loads, and the gravity design optimizer 260 doesnot take any lateral loads (e.g., the building wind load(s)) intoaccount.

As shown, in some embodiments, the gravity design optimizer 260includes, without limitation, a gravity slab optimizer 360, a gravitybeam optimizer 370, and a gravity column optimizer 380. In someembodiments, the gravity design optimizer 260 configures the gravityslab optimizer 360 to optimize the sizing of the slab specified in theslab data 312 based on the constraints 132 and the objective function134 without taking any lateral loads into account. The gravity slaboptimizer 360 can optimize the sizing of the slab in any technicallyfeasible fashion.

In some embodiments, the gravity slab optimizer 360 sorts differentdesign options from best to worst based on corresponding objectivevalues. The gravity slab optimizer 360 then executes a bisectionalgorithm to find the design option having the best objective value thatsatisfies constraints 132. In some other embodiments, the gravity slaboptimizer 360 iteratively optimizes the sizing of the slab via anon-gradient based optimization algorithm. For instance, in someembodiments, the gravity slab optimizer 360 determines the availablethicknesses of the slab and the available thicknesses of thereinforcement based on the design variable data 136 and the type of theslab. The gravity slab optimizer 360 uses structural engineeringfundamentals to determine the smallest thickness and the smallestreinforcement for the smallest thickness that satisfies the constraints132.

In some embodiments, prior to modifying the sizing of the slab, thegravity slab optimizer 360 computes the live load and an initial valuefor the dead load. As the gravity slab optimizer 360 iterativelymodifies the sizing of the slab, the gravity slab optimizer recomputesthe associated dead load. In some embodiments, the initial value for thedead load includes, without limitation, contributions from surfacefinishes (e.g., floor tiles) that the gravity slab optimizer 360 doesnot subsequently change in addition to contributions from theself-weight of the slab that the gravity slab optimizer 360 recomputesas the gravity slab optimizer modifies the sizing of the slab. In someembodiments, after the gravity slab optimizer 360 finishes modifying thesizing of the slab, the gravity slab optimizer 360 updates the floorsizing data 320, the floor live load data 322, and the floor dead loaddata 324. In the same or other embodiments, the gravity designapplication 140 determines the slab spanning type (e.g., one-wayspanning, two-way spanning, cantilever, etc.) using domainknowledge-based rules.

Subsequently, in some embodiments, the gravity design optimizer 260distributes the dead loads and the live loads across a subset of thebeams specified in the beam list 314 based on the slab spanning type.The gravity design optimizer 260 updates the floor live load data 322and the floor dead load data 324 accordingly. The gravity designoptimizer 260 then configures the gravity beam optimizer 370 to optimizethe sizing of the beams specified in the beam list 314 based on theconstraints 132 and the objective function 134 without taking anylateral loads into account. The gravity beam optimizer 370 can optimizethe sizing of the beams in any technically feasible fashion. Forinstance, in some embodiments, the beam optimizer 370 can use abisection algorithm to optimize the sizing of the beams.

For instance, in some embodiments, the gravity beam optimizer 370iteratively optimizes the sizing of the beams via a bisection algorithmand any number and/or type of structural engineering fundamentals. Inthe same or other embodiments, the gravity beam optimizer 370 optimizesthe sizing of the beams via any number and/or type of expert systemsand/or trained machine learning models. In some embodiments, after thegravity beam optimizer 370 finishes modifying the sizing of the beams,the gravity beam optimizer 370 updates the floor sizing data 320 and thefloor dead load data 324.

Subsequently, in some embodiments, the gravity design optimizer 260distributes the dead loads and the live loads across the columnsspecified in the column list 316 and updates the floor live load data322 and the floor dead load data 324 accordingly. The gravity designoptimizer 260 then configures the gravity column optimizer 380 tooptimize the sizing of the columns specified in the column list 316based on the constraints 132 and the objective function 134 withouttaking any lateral loads into account. The gravity column optimizer 380can optimize the sizing of the columns in any technically feasiblefashion.

For instance, in some embodiments, the gravity column optimizer 380iteratively optimizes the sizing of the columns via a bisectionalgorithm and any number and/or type of structural engineeringfundamentals. In the same or other embodiments, the gravity columnoptimizer 380 optimizes the sizing of the columns via any number and/ortype of expert systems and/or trained machine learning models. In someembodiments, after the gravity column optimizer 380 finishes modifyingthe sizing of the columns, the gravity column optimizer 380 updates thefloor sizing data 320 and the floor dead load data 324.

As shown, in some embodiments, the gravity design optimizer 260 thengenerates the optimized partial design 268 based on the floor designdataset 368. In some embodiments, the gravity design optimizer 260computes the partial objective value 266 based on the floor designdataset 368 and the objective function 134. In some other embodiments,the gravity design optimizer 260 computes the partial objective value266 based on the optimized partial design 268 and the objective function134.

In some embodiments, the gravity design optimizer 260 transmits theoptimized partial design 268 and/or the partial objective value 266 toany number of other software applications in any technically feasiblefashion. In the same or other embodiments, the gravity design optimizer260 stores the optimized partial design 268 and/or the partial objectivevalue 266 in a memory that is accessible to at least one other softwareapplication. In some embodiments, the gravity design optimizer 260stores the optimized partial design 268 and the partial objective value266 in a memory that is accessible to the gravity design application140.

Note that the techniques described herein are illustrative rather thanrestrictive and can be altered without departing from the broader spiritand scope of the invention. For instance, in some embodiments, thegravity design optimizer 260 omits the floor design dataset 368 andconfigures the gravity slab optimizer 360, the gravity beam optimizer370, and the gravity column optimizer 380 to modify the partial design258 in any technically feasible fashion.

Using Unsupervised Clustering to Generate Frame Grids

FIG. 4 is a more detailed illustration of the grid generationapplication 150 of FIG. 1, according to various embodiments. Forexplanatory purposes only, in the embodiment depicted in FIG. 4, thefunctionality of the grid generation application 150 is described in thecontext of solving the frame grid optimization problem describedpreviously herein in conjunction with FIG. 1.

In some embodiments, the structural design application 120 inputs thegravity designs 148(1)-148(N) and optionally the gravity designobjective values 146(1)-146(N), and/or any amount of the parameter data138 into the grid generation application 150. In response, the gridgeneration application 150 generates and outputs the frame grids158(1)-158(M). In some other embodiments, the grid generationapplication 150 can be configured to generate any number and/or types ofgrids for any type of lateral load resisting structural elements based,at least in part, on any number and/or types of designs for structuralsystems that resist vertical loads.

As described previously herein, each of the gravity designs 148specifies, without limitation, the positions, types, and materials ofany number of structural members that, together, resist vertical loads.In some embodiments, the gravity design objective value 146(x), where xis an integer between 1 and N, correlates to a degree of convergencebetween the gravity design 148(x) and the design objectives. The portionof the parameter data 138 that is inputted into the grid generationapplication 150 specifies, without limitation, parameter values for anynumber and/or type of parameters that are relevant to generating theframe grids 158.

As shown, in some embodiments, the grid generation application 150includes, without limitation, a base direction engine 410, a gridequation engine 440, and a grid specification engine 490. Upon receivingthe gravity designs 148, the grid generation application 150 generatesan edge set 402. To generate the edge set 402, the grid generationapplication 150 initializes the edge set 402 to an empty list. For eachof the gravity designs 148, the grid generation application 150 adds thebeams (not shown) that are attached to at least one of the columns (notshown) to the edge set 402 as edges (not shown). Accordingly, the edgeset 402 includes, without limitation, any number of edges that eachcorresponds to a different beam. Each of edges is associated with both adirection and a length.

In some embodiments, the grid generation application 150 associates eachof the edges with the gravity design 148 that includes the correspondingbeam. In the same or other embodiments, the grid generation application150 denotes each edge that is on the boundary of the gravity design 148that includes the corresponding beam as a boundary edge. The gridgeneration application 150 can associate the edges with the gravitydesigns 148 and/or denote the edges that are also boundary edges in anytechnically feasible fashion.

In some embodiments, the grid generation application 150 inputs the edgeset 402 and optionally any portion of the parameter data 138 into thebase direction engine 410. In response, the base direction engine 410generates a ranked direction cluster set list 408. The ranked directioncluster set list 408 is described in greater detail below. As shown, thebase direction engine 410 includes, without limitation, a directionclustering engine 420.

In some embodiments, the base direction engine 410 generates a weighteddirection set 412 based on the edge set 402. To generate the weighteddirection set 412, the base direction engine 410 determines the uniquedirections of the edges included in the edge set 402. The base directionengine 410 then weights each of the directions based on the total lengthof the non-boundary edges in the direction and the total length of theboundary edges in the direction to generate a corresponding weighteddirection (not shown). Subsequently, the base direction engine 410generates the weighted direction set 412 that includes, withoutlimitation, the weighted directions. In some other embodiments, the basedirection engine 410 can determine and weight the directions in anytechnically feasible fashion based on any amount and/or types ofcriteria that are relevant to generating the frame grids 158.

The base direction engine 410 then inputs the weighted direction set 412and optionally any portion of the parameter data 138 into the directionclustering engine 420. The direction clustering engine 420 performs anynumber and/or types of unsupervised clustering operations based on theweighted direction set 412 to generate direction cluster sets428(1)-428(D), where D can be any positive integer. The directioncluster sets 428(1)-428(D), are also referred to herein individually as“the direction cluster set 428” and collectively as “the directioncluster sets 428.” Each of the direction cluster sets 428 specifies,without limitation, a different distribution of the weighted directionsincluded in the weighted direction set 412 across any number ofdirection clusters (not shown). Notably, the number of directionclusters included in any given pair of the direction cluster sets 428can be the same or different.

Subsequently, the direction clustering engine 420 can perform any numberand/or types of ranking and/or filtering operations on the directioncluster sets 428 to generate the ranked direction cluster set list 408.The direction clustering engine 420 and/or the base direction engine 410can determine the total number of the direction cluster sets 428(denoted herein as D) in any technically feasible fashion based on anyamount and/or type of data. For instance, in some embodiments, the basedirection engine 410 determines a value for D based on the parameterdata 138 and the configures the direction clustering engine 420 togenerate D of the direction cluster sets 428. In some other embodiments,the direction clustering engine 420 implements a default value for D.

More specifically, in some embodiments, the direction clustering engine420 includes, without limitation, K-means clustering algorithms424(1)-424(D) and a cluster set ranking engine 430. Each of the K-meansclustering algorithms 424(1)-424(D) is a different instance of a K-meansclustering algorithm 424 (not explicitly shown) that implements K-meansclustering. As persons skilled in the art will recognize, K-meansclustering refers to a type of well-known unsupervised learningalgorithms that generate a pre-determined number of clusters. TheK-means clustering algorithms 424(1)-424(D) are also referred to hereinindividually as “the K-means clustering algorithm 424” and collectivelyas “the K-means clustering algorithms 424.” In some embodiments, thebase direction engine 410 configures the K-means clustering algorithms424(1)-424(D) to concurrently generate the direction cluster sets428(1)-428(D), respectively.

In some other embodiments, the base direction engine 410 configures lessthan D instances of the K-means clustering algorithm 424 to generate thedirection cluster sets 428(1)-428(D) sequentially, concurrently, or inany combination thereof in any technically feasible fashion. Forinstance, in some embodiments, the base direction engine 410 configuresa single instance of the K-means clustering algorithm 424 tosequentially generate the direction cluster sets 428(1)-428(D).

The direction clustering engine 420(0) can configure any number ofinstances of the K-means clustering algorithm 424 to generate thedirection cluster sets 428(1)-428(D), respectively, in any technicallyfeasible fashion. For instance, in some embodiments, the directionclustering engine 420(0) inputs the clustering setting 422(1)-422(D),respectively, into the K-means clustering algorithms 424(1)-424(D),respectively. In response, the K-means clustering algorithms424(1)-424(D) output the direction cluster sets 428(1)-428(D),respectively.

The clustering settings 422(1)-422(D) are also referred to hereinindividually as “the clustering setting 422,” and collectively as “theclustering settings 422.” Each of the clustering settings 422 includes,without limitation, a different combination of values for any numberand/or types of settings that are relevant to the K-means clusteringalgorithm 424. In some embodiments, each of the clustering settings 422specifies a different combination of a value of K (i.e., the number ofthe clusters to generate) and seeding.

The direction clustering engine 420 can determine the clusteringsettings 422 in any technically feasible fashion. For instance, in someembodiments, the direction clustering engine 420 randomly generates thevalue of K and the seeding for each of the clustering settings 422. Insome other embodiments, the direction clustering engine 420 determinesan allowable range for the value of K and any number and/or types ofseeding heuristics based on the parameter data 138. In yet otherembodiments, the base direction engine 410 determines the clusteringsettings 422 based on the parameter data 138 and then inputs theclustering settings 422 into the direction clustering engine 420.

As shown, in some embodiments, the direction clustering engine 420inputs the direction cluster sets 428(1)-428(D) into the cluster setranking engine 430. In response, the cluster set ranking engine 430performs any number and/or type of ranking and/or filtering operationson the direction cluster sets 428(1)-428(D) to generate the rankeddirection cluster set list 408. The ranked direction cluster set list408 includes, without limitation, any number of the direction clustersets 428(1)-428(D) that are ranked in any technically feasible fashionbased on any number and/or types of criteria.

In some embodiments, the cluster set ranking engine 430 includes,without limitation, an elbow method heuristic 432. The elbow methodheuristic 432 is based on the elbow method. As persons skilled in theart will recognize, the elbow method refers to a well-known type oftechnique for determining an optimal number of clusters (i.e., value ofK) into which a set of points can be clustered. As shown, in someembodiments, the elbow method heuristic 432 determines an elbow point434 based on the direction cluster sets 428. In some embodiments, foreach of the direction cluster sets 428, the elbow method heuristic 432determines a value for a variance-based metric. The elbow methodheuristic 432 clusters values of K vs values of the variance-basedmetric for the direction cluster sets 428 into two groups and then setsthe elbow point 434 equal to the intersection point between the twogroups.

In some embodiments, for each of the direction cluster sets 428, thecluster set ranking engine 430 computes a distance to the elbow point434 based on the associated values of K and the variance-based metric.The cluster set ranking engine 430 then ranks the direction cluster sets428 based on increasing distance to the elbow point 434 to generate theranked direction cluster set list 408. In some embodiments, the clusterset ranking engine 430 can filter out any number of the directioncluster sets 428 included in the ranked direction cluster set list 408based on any technically feasible criteria. For instance, in someembodiments, the cluster set ranking engine 430 determines a minimumvalue of variance needed in the ranked direction cluster set list 408based on the parameter data 138. If the ranked direction cluster setlist 408 includes those with variance greater than the minimum needed,then the cluster set ranking engine 430 removes them. For instance, insome embodiments, the cluster set ranking engine 420 determines amaximum allowed value for the variance-based metric based on theparameter data 138. For each of the direction cluster sets 428 includedin the ranked direction cluster set list 408, if the associated valuefor the variance-based metric is higher than the maximum allowed value,then the cluster set ranking engine 430 removes the direction clusterset 428 from the ranked direction cluster set list 408.

In some embodiments, the grid generation application 150 generates abase direction set 436 based on the direction cluster set 428 having thehighest ranking as per the ranked direction cluster set list 408. Asshown, the base direction set 436 includes, without limitation, basedirections 438(1)-438(B), where B is the total number of directionclusters included in the direction cluster set 428 having the highestranking and can therefore be any positive integer. The base directions438(1)-438(B) are also referred to herein individually as “the basedirection 438,” and collectively as “the base directions 438.” Each ofthe base directions 438 corresponds to a different direction clusterincluded in the direction cluster set 428 having the highest ranking. Insome embodiments, the grid generation application 150 sets each of thebase directions 438 equal to the direction associated with the centroidof the corresponding direction cluster.

Subsequently, in some embodiments, the grid generation application 150inputs the base direction set 436, the edge set 402, and optionally thegravity design objective values 146(1)-146(N) and/or any portion of theparameter data 138 into the grid equation engine 440. In response, thegrid equation engine 440 generates the frame grids 158(1)-158(M).

Although not depicted in FIG. 4, in some other embodiments, the gridgeneration application 150 generates a different instance of the basedirection set 436 for each of any number of the direction cluster setsincluded in the ranked direction cluster set list 408. The instances ofthe base direction set 436 are also referred to herein collectively as“the base direction sets 436.” Each of the base direction sets 436 caninclude, without limitation, a different total number of the basedirections 438. The grid generation application 150 inputs each of thebase direction sets 436 into a different instance of the grid equationengine 440 to generate one or more of the frame grids 158 for each ofthe base direction sets 436.

As shown, in some embodiments, the grid equation engine 440 includes,without limitation, an equation partitioning engine 450 and equationclustering engines 460(1)-460(B), where B is the total number of thebase directions 438 included in the base direction set 436 and cantherefore be any positive integer. The equation clustering engines460(1)-460(B) are different instances of an equation clustering engine460 (not explicitly shown). For explanatory purposes only, the equationclustering engines 460(1)-460(B) are also referred to hereinindividually as “the equation clustering engine 460” and collectively as“the equation clustering engines 460.”

In some embodiments, the grid equation engine 440 generates a weightedequation set 442 based on the edge set 402 and optionally the gravitydesign objective values 146(1)-146(N). The weighted equation set 442includes, without limitation, a different weighted equation (not shown)for each of the edges included in the edge set 402. The weightedequations can be specified in any technically feasible fashion. Forinstance, in some embodiments, each of the weighted equations isspecified in the format of “Ax+By+C=0.” To generate the weightedequation set 442, the grid equation engine 440 can determine and weightthe weighted equations in any technically feasible fashion based on anyamount and/or types of criteria that are relevant to generating theframe grids 158.

In some embodiments, the grid equation engine 440 weights each equationbased on a combination of an architectural weight attributable toarchitectural features and a solution weight. For instance, in someembodiments, the grid equation engine 440 sets the architectural weightsfor equations corresponding to boundary edges to higher values than thearchitectural weights for equations corresponding to other edges. In thesame or other embodiments, the grid equation engine 440 assigns highersolution weights to equations corresponding to better solutions as perthe objective values 146 for the gravity designs 148 that include thecorresponding edges.

As shown, in some embodiments, the equation partitioning engine 450generates weighted equations subsets 458(1)-458(B) based on the weightedequation set 442 and the base directions 438(1)-438(B), respectively.For explanatory purposes only, the weighted equations subsets458(1)-458(B) are also referred to herein individually as “the weightedequations subset 458” and collectively as “the weighted equationssubsets 458.” The weighted equation subsets 458(1)-458(B) representdifferent subsets of the weighted equation set 442 that are associatedwith the base directions 438(1)-438(B), respectively. The equationpartitioning engine 450 can generate the weighted equation subsets458(1)-458(B) in any technically feasible fashion.

In some embodiments, the equation partitioning engine 450 generates theweighted equation subsets 458(1)-458(B) based on the base directions438(1)-438(B), and a tolerance amount (e.g., 3 degrees). For each of thebase directions 438, the equation partitioning engine 450 selects thesubset of the weighted equations included in the weighted equation set442 that are approximately parallel to the base direction 438. As usedherein, a weighted equation is approximately parallel to the basedirection 438 when the angle between the line represented by theweighted equation and the base direction 438 is within the toleranceamount of zero degrees (e.g., between −3 and 3 degrees). The equationpartitioning engine 450 can determine the tolerance amount in anytechnically feasible fashion. In some instance, in some embodiments, theequation partition engine 450 implements a default tolerance amount.

In some other embodiments, the equation partitioning engine 450 isreplaced with an edge partitioning engine (not shown) and an equationengine (not shown). For each of the base directions 438(1)-438(B), theedge partitioning engine determines a different subset of the edgesincluded in the edge set 402 that are approximately parallel to the basedirection 438. As used herein, an edge is approximately parallel to thebase direction 438 when a direction associated with the edge is within atolerance amount of the base direction 438 (e.g., within 3 degrees ofthe base direction 438. For each of the base directions 438, theequation engine generates the weighted equation subset 458 that isassociated with the base direction 438 based on the subset of the edgesthat is associated with the base direction and optionally the gravitydesign objective values 146(1)-146(N).

As shown, in some embodiments, the grid equation engine 440 inputs anyportion (including none) of the parameter data 138 and the weightedequation subsets 458(1)-458(B) into the equation clustering engines460(1)-460(B), respectively. In response, the equation clusteringengines 460(1)-460(B) generate ranked equation cluster set lists468(1)-468(B). For explanatory purposes only, the ranked equationcluster set lists 468(1)-468(B) are also referred to herein individuallyas “the ranked equation cluster set list 468” and collectively as “theranked equation cluster set lists 468.”

In some other embodiments, the grid equation engine 440 inputs anyportion (including none) of the parameter data 138 and the weightedequation subsets 458(1)-458(B) into any number of instances of theequation clustering engine 460 sequentially, concurrently, or in anycombination thereof. For instance, in some embodiments, the gridequation engine 440 sequentially inputs the weighted equation subsets458(1)-458(B) into a single instance of the equation clustering engine460. In response, the single instance of the equation clustering engine460 sequentially outputs the ranked equation cluster set lists468(1)-468(B).

Upon receiving one of the weighted equation subsets 458, the gridequation engine 440 performs any number and/or types of unsupervisedclustering operations based on the weighted equations included in theweighted equation subsets 458 to generate any number of equation clustersets (not shown). Each of the equation cluster sets specifies, withoutlimitation, a different distribution of the weighted equations acrossany number of equation clusters (not shown). Notably, the number ofequation clusters included in any given pair of the equation clustersets can be the same or different.

Subsequently, the grid equation engine 440 can perform any number and/ortypes of ranking and/or filtering operations on the equation clustersets to generate the ranked equation cluster set list 468. Accordingly,in some embodiments, the ranked equation cluster set list 468 specifies,without limitation, one or more of the equation cluster sets. Moreprecisely, the ranked equation cluster set list 468(b), where b is aninteger from 1 to B, specifies, without limitation, one or more equationcluster sets that are associated with the base direction 438(b).

The equation clustering engine 460 can acquire (e.g., receive ordetermine) any amount and/or types of configuration data in anytechnically feasible fashion. Some examples of configuration data are,without limitation, the total number of equation cluster sets, anynumber and/or type of settings associated with generating each of theequation cluster sets, any number and/or types of ranking criteria, andany number and/or types of filtering criteria. For instance, in someembodiments, the grid equation engine 440 determines any amount and/ortype of configuration data based on the parameter data 138.

Although not depicted, in some embodiments, the equation clusteringengine 460 performs the same type of clustering, ranking, and filteringoperations on the weighted equation subset 458 that the directionclustering engine 420 performs on the weighted direction set 412. Forinstance, in some embodiments, the equation clustering engine 460includes, without limitation, any number of instances of the K-meansclustering algorithm 424 and the elbow method heuristic 432. Theequation clustering engine 460 configures each instance of the K-meansclustering algorithm 424 to execute clustering operations on theweighted equations included in the weighted equation subset 458 based ondifferent instances of the clustering settings 422 (not explicitlyshown). In response, each instance of the K-means clustering algorithm424 generates one of the equation cluster sets,

In the same or other embodiments, the equation clustering engine 460then uses the elbow method heuristic 432 to determine a new instance ofthe elbow point 434. The equation clustering engine 460 then ranks theequation cluster sets based on increasing distance to the elbow point434 to generate the ranked equation cluster set list 468. In someembodiments, the equation clustering engine 460 can perform any numberand/or type of filtering operations on the ranked equation cluster setlist 468.

As shown, in some embodiments, the grid specification engine 490generates the frame grids 158(1)-158(M), where M can be any positiveinteger, based on the ranked equation cluster set lists 468(1)-468(B).Each of the frame grids 158 includes, without limitation, a differentcombination of B sets of grid lines, where each combination of B sets ofgrid lines includes a set of grid lines for each of the base directions438(1)-438(B). The grid specification engine 490 can generate the framegrids 158 in any technically feasible fashion.

In some embodiments, to generate the frame grid 158(m), where m is aninteger between 1 and M, the grid specification engine 490 selects oneof the equation cluster sets from each of the ranked equation clusterset lists 468(1)-468(B). The grid specification engine 490 thengenerates a different set of grid lines for each of the B selectedequation cluster sets. Subsequently, the grid specification engine 490aggregates the B sets of grid lines to generate the frame grid 158(m).

The grid specification engine 490 can generate the set of grid lines foreach of the selected equation cluster sets in any technically feasiblefashion. In some embodiments, for a given equation cluster set, the gridspecification engine 490 generates the set of grid lines that includes,without limitation, a different grid line for each of the equationclusters included in the equation cluster set. In the same or otherembodiments, the grid specification engine 490 generates the grid linefor a given cluster based on the equation associated with the centroidof the cluster. In some embodiments, after generating the grid lines,the grid specification engine 490 snaps each of the grid lines to anynearby architectural features (e.g., the boundary edges) and extendseach of the grid lines beyond the boundary edges associated with thenearest floor.

In some embodiments the set of grid lines for each of the B selectedequation cluster sets specifies one or more equations that areapproximately parallel to the base direction 438 associated with theselected equation cluster set. Accordingly, for each of the basedirections 438(1)-438(B), each of the frame grids 158(1)-158(M)includes, without limitation, one or more grid lines that are parallelto the base direction 438.

The grid specification engine 490 can select the M differentcombinations of B equation cluster sets for the frame grids158(1)-158(M) in any technically feasible fashion. In some embodiments,the grid specification engine 490 selects the r equation cluster setsthat are the highest ranked in each of the ranked equation cluster setlists 468(1)-468(B), where r can be any positive integer. The gridspecification engine 490 then generates all possible combinations of asingle selected equation cluster sets from each of the ranked equationcluster set lists 468(1)-468(B). For each of the resulting B{circumflexover ( )}r combinations of the equation cluster sets, the gridspecification engine 490 generates a different one of the frame grids158.

In some other embodiments, the grid specification engine 490 implementsa genetic algorithm to iteratively determine different combinations ofthe equation cluster sets. For instance, in some embodiments, the gridspecification engine 490 implements the genetic algorithm that includes,without limitation, B different design variables representing the rankedequation cluster set lists 468. In the same or other embodiments, thegenetic algorithm determines the fitness of each combination of thedesign variables based on the building objective values 186 associatedwith the structural designs 188 generated based on the combination ofthe design variables.

In some embodiments, after the grid specification engine 490 generatesthe frame grids 158, the grid generation application 150 transmits oneor more of the frame grids 158 to any number of other softwareapplications in any technically feasible fashion. In the same or otherembodiments, the grid generation application 150 stores the frame grids158 in a memory that is accessible to at least one other softwareapplication. In some embodiments, the grid generation application 150stores the frame grids 158 in a memory that is accessible to thestructural design application 120.

Defining a Frame System Via a Genetic Algorithm

FIG. 5 is a more detailed illustration of the frame specificationapplication 170 of FIG. 1, according to various embodiments. Forexplanatory purposes only, in the embodiment depicted in FIG. 4, thefunctionality of the frame specification application 170 is described inthe context the frame grid optimization problem described previouslyherein in conjunction with FIG. 1. More specifically, the functionalityof the frame specification application 170 is described in the contextof an iterative design optimization portion of the overall design flowthat the iterative optimization application 172 executes to generate thestructural design 188 that resists both vertical and lateral loads.

As described previously herein in conjunction with FIG. 1, in someembodiments, to initiate a first design optimization iteration, theiterative optimization application 172 inputs the wind directions164(1)-164(W), the frame grid 158 and the gravity design 148 into theframe specification application 170. In response, the framespecification application 170 generates the frame system specification178 that specifies, without limitation, locations for at least one frame(not shown in FIG. 5) in each of the wind directions 164.

To complete the first design optimization iteration, the iterativeoptimization application 172 configures the iterative sizing application180 to generate the structural design 188 and compute the buildingobjective value 186 based, at least in part, on the frame systemspecification 178. The structural design 188 is a design for astructural system of the building that includes, without limitation, theframes at the locations specified in the frame system specification 178and is optimized based on the constraints 132 and the objective function134 while taking both vertical and lateral loads into account. In someembodiments, the building objective value 186 correlates to the degreeof convergence between the structural design 188 and the designobjectives associated with the building.

To initiate each of any number of subsequent design optimizationiterations, the iterative optimization application 172 inputs thebuilding objective value 186 into the frame specification application170. In response, the frame specification application 170 generates anew version of the frame system specification 178 based on the buildingobjective value 186. To complete the design optimization iteration, theiterative optimization application 172 configures the iterative sizingapplication 180 to re-generate the structural design 188 and re-computethe building objective value 186 based, at least in part, on the newversion of the frame system specification 178.

Note that the techniques described herein are illustrative rather thanrestrictive and can be altered without departing from the broader spiritand scope of the invention. For instance, in some other embodiments, anyinstance of the frame specification application 170 can iterativelyoptimize the locations of the frames in a frame system (not shown) basedon any type of design for a structure of a building, any type of grid,any number of lateral loading directions, and any number and/or types ofoptimization criteria.

As shown, in some embodiments, the frame specification application 170includes, without limitation, a wind direction allocation engine 510,frame partitioning engines 530(1)-530(W), a genetic algorithm 550, and aframe selection engine 580. The wind direction allocation engine 510generates potential frame location sets 514(1)-514(W) based on the framegrid 158(1), the gravity design 148(1), and the wind directions164(1)-164(W), respectively. For explanatory purposes only, thepotential frame location sets 514(1)-514(W) are also referred to hereinindividually as “the potential frame location set 514” and collectivelyas “the potential frame location sets 514”

In some embodiments, each of the potential frame location sets 514includes, without limitation, a different set of locations, where eachlocation is within a tolerance amount of a different grid line in theframe grid 158 and corresponds to a different potential frame withrespect to the gravity design 148. In some other embodiments, prior toexecuting the frame specification application 170 during the firstdesign optimization iteration, the iterative optimization application172 regenerates the layout of the gravity design 148 based on the framegrid 158. As a result, each of the locations included in the potentialframe location sets 514 matches a different grid line in the frame grid158 and corresponds to a different potential frame with respect to thegravity design 148.

As referred to herein, a “potential” frame with respect to the gravitydesign 148 refers to a group of the structural members included in thegravity design 148 that can be connected via moment-resisting joints toform a frame that resists both vertical and lateral loads. In someembodiments, each potential frame in the gravity design 148 includes,without limitation, a group of one or more beams and one or more columnsfrom the gravity design 148 that can be interconnected via any numberand/or types of rigid joints, any number and/or type of semi-rigidjoints, or any combination thereof. The locations included in thepotential frame location sets 514 are also referred to herein as“potential frame locations.”

In the same or other embodiments, the potential frame location sets514(1)-514(W) include, without limitation, any number of locationscorresponding to potential frames that primarily resist wind loadsassociated with the wind directions 164(1)-164(W), respectively, whenthe constituent structural members are intra-connected viamoment-resisting joints. In some embodiments, each of the grid lines isassociated with at most one of the locations in the potential framelocation sets 514. The wind direction allocation engine 510 can generatethe potential frame location sets 514 in any technically feasiblefashion.

For instance, in some embodiments, the wind direction allocation engine510 determines any number of potential frames with respect to thegravity design 148 that each have a location that is within a toleranceamount of a different associated grid line in the frame grid 158. In thesame or other embodiments, the tolerance amount is equal to zero andeach of the potential frames is on a different grid line in the framegrid 158. The wind direction allocation engine 510 then computes theprojection of each of the wind directions 164 onto each of the potentialframes. For each of potential frames that is associated with at leastone non-zero projection, the wind direction allocation engine 510 addsthe associated location to the potential frame location set 514corresponding to the wind direction 164 having the greatest projectiononto the potential frame.

As shown, in some embodiments, the wind direction allocation engine 510computes a building load centroid 520 based on the gravity design 148.The wind direction allocation engine 510 can define and/or compute thebuilding load centroid 520 in any technically feasible fashion. In someembodiments, the building load centroid 520 is a building load centroidthat the wind direction allocation engine 510 sets equal to the centroidof the total dead load and live load across all the floors in thebuilding based on the gravity design 148. In the same or otherembodiments, the frame specification application 170 configures theframe partitioning engines 530(1)-530(W) to bifurcate the potentialframe location sets 514(1)-514(W) into left frame groups 542(1)-542(W)and right frame groups 544(1)-544(W) based on the building load centroid520.

Each of the frame partitioning engines 530(1)-530(W) is a differentinstance of a frame partitioning engine 530 (not explicitly shown). Forexplanatory purposes only, the frame partitioning engines 530(1)-530(W)are also referred to herein individually as “the frame partitioningengine 530” and collectively as “the frame partitioning engines 530.”The left frame groups 542(1)-542(W) are also referred to hereinindividually as “the left frame group 542” and collectively as “the leftframe groups 542.” The right frame groups 544(1)-544(W) are alsoreferred to herein individually as “the right frame group 544” andcollectively as “the right frame groups 544.” The locations specified inthe left frame group2 542 and the right fame groups 544 are alsoreferred to herein as “potential frame locations.”

In some embodiments, for each of the wind directions 164, the framespecification application 170 inputs the wind direction 164(w), where wis an integer from 1 to W, the potential frame location set 514(w), andthe building load centroid 520 into the frame partitioning engine530(w). In response, the frame partitioning engine 530(w) sets the leftframe group 542(w) equal to the subset of the locations specified in thepotential frame location set 514(w) that are to the left of the buildingload centroid 520 with respect to the wind direction 164(w). The framepartitioning engine 530(w) sets the right frame group 544(w) equal tothe subset of the locations specified in the potential frame locationset 514(w) that are to the right of the building load centroid 520 withrespect to the wind direction 164(w). The frame partitioning engine530(w) then outputs the left frame group 542(w) and the right framegroup 544(w).

In some other embodiments, the frame specification application 170configures any number of instances of the frame partitioning engine 530to bifurcate the potential frame location sets 514(1)-514(W) based onthe building load centroid 520 sequentially, concurrently, or in anycombination thereof. For instance, in some embodiments, the framespecification application 170 configures a single instance of the framepartitioning engine 530 to sequentially bifurcate the potential framelocation sets 514(1)-514(W) based on the building load centroid 520.

In some embodiments, to generate the genetic algorithm 550, the framespecification application 170 configures a metaheuristic to iterativelyand collectively optimize left frame counts 572(1)-572(W) and rightframe counts 574(1)-574(W) based on the building objective value186(1,1). The frame specification application 170 therefore defines theleft frame counts 572(1)-572(W) and the right frame counts 574(1)-574(W)as integer design variables of the genetic algorithm 550. The left framecounts 572(1)-572(W) are also referred to herein individually as “theleft frame count 572” and collectively as “the left frame counts 572.”The right frame counts 574(1)-574(W) are also referred to hereinindividually as “the right frame count 574” and collectively as “theright frame counts 574.” The left frame counts 572 and the right framecounts 574 are also referred to herein as “location counts.”

The left frame count 572(w), for an integer w from 1 to W, specifies thetotal number of the locations in the left frame group 542(w) that are tobe frames in a frame system. As shown, in some embodiments, the framespecification application 170 configures the genetic algorithm 550 toset the left frame counts 572(1)-572(W) to integers within left framecount ranges 562(1)-562(W), respectively. For the left frame countranges 562(1)-562((W), the frame specification application 170(1-1) setsthe lower bounds to one and the upper bounds to the sizes of the leftframe groups 542(1)-542(W), reactively. Each of the left frame countranges 562(1)-562(2) is therefore an integer range.

Similarly, the right frame count 574(w), for an integer w from 1 to W,specifies the total number of the locations in the right frame group544(w) that are to be frames in the frame system. As shown, in someembodiments, the frame specification application 170 configures thegenetic algorithm 550 to set the right frame counts 574(1)-574(W) tointegers within right frame count ranges 564(1)-564(W), respectively.For the right frame count ranges 564(1)-564((W), the frame specificationapplication 170 sets the lower bounds to one and the upper bounds to thesizes of the right frame groups 544(1)-544(W), reactively. Each of theright frame count ranges 564(1)-564(W) is therefore an integer range.

After configuring the genetic algorithm 550, the frame specificationapplication 170 causes the genetic algorithm 550 to determine the leftframe counts 572 and the right frame counts 574 for the first designoptimization iteration. The genetic algorithm 550 can initiallydetermine the left frame counts 572 and the right frame counts 574 inany technically feasible fashion. For instance, in some embodiments, thegenetic algorithm 550 sets each of the left frame counts 572(1)-572(W)equal to a random integer within each of the left frame count ranges562(1)-562(W), respectively, and each of the right frame counts574(1)-574(W) equal to a random integer within each of the right framecount ranges 564(1)-564W), respectively. In some other embodiments, thegeneric algorithm 550 sets each of the left frame counts 572(1)-572(W)and each of the right frame counts 574(1)-574(W) equal to one.

In some embodiments, after the genetic algorithm 550 determines orre-determines the left frame counts 572 and the right frame counts 574for a given design optimization iteration, the frame selection engine580 generates the frame system specification 178 for the designoptimization iteration. As shown, in some embodiments, the frameselection engine 580 generates the frame system specification 178 basedon the left frame counts 572, the left frame groups 542, the right framecounts 574, and the right frame groups 544. The frame selection engine580 can generate the frame system specification 178 in any technicallyfeasible fashion.

In some embodiments, the frame selection engine 580 implements a frameselection rule (not shown) that encapsulates design and structuralengineering fundamentals to generate the frame system specification 178.As per design and structural engineering fundamentals, as the distanceof a frame from the building load centroid 520 increases, theeffectiveness with which the frame resists wind also increases. Tooptimize the effectiveness of the frame system, the frame selectionengine 580 implements a frame selection rule specifying that locationsfor frames are to be selected from the left frame groups 542(w) and theright frame groups 544 frame in order of decreasing distance from thebuilding load centroid 520.

In the same or other embodiments, for each of the left frame groups542(w), where w is an integer from 1 to W, the frame selection engine580 selects the left frame count 572(w) of the locations specified inthe left frame group 542(w) based on the frame selection rule.Accordingly, the frame selection engine 580 selects the locationsspecified in the left frame group 542(w) that are furthest from thebuilding load centroid 520. For example, if the left frame count 572(1)is two, then the frame selection engine 580 selects the two locationsspecified in the left frame group 542(w) that are furthest from thebuilding load centroid 520.

Similarly, in some embodiments, for each of the right frame groups544(w), where w is an integer from 1 to W, the frame selection engine580 selects the right frame count 574(w) of the locations specified inthe right frame group 544(w) based on the frame selection rule.Accordingly. the frame selection engine 580 selects the locationsspecified in the right frame group 544(w) that are furthest from thebuilding load centroid 520. For example, if the right frame count 574(1)is three, then the frame selection engine 580 selects the threelocations from the right frame group 544(w) that are furthest from thebuilding load centroid 520.

Subsequently, the frame selection engine 580 generates the frame systemspecification 178 for the frame system that includes, withoutlimitation, a different frame at each of the selected locations. Theframe system specification 178 can specify the frame system in anytechnically feasible fashion. For instance, in some embodiments, theframe system specification 178 is a list of the selected locations.

In some embodiments, after the frame selection engine 580 generates theframe system specification 178, the frame specification application 170transmits the frame system specification 178, to any number of othersoftware applications in any technically feasible fashion. In the sameor other embodiments, the frame specification application 170 stores theframe system specification 178 in a memory that is accessible to atleast one other software application. In some embodiments, the framespecification application 170 stores the frame system specification 178in a memory that is accessible to the iterative optimization application172, and the iterative optimization application 172 inputs the framesystem specification 178 into the iterative sizing application 180.

In some embodiments, after the frame specification application 170generates the frame system specification 178 for a current designoptimization iteration, the frame specification application 170 canre-generate the frame system specification 178 for a new designoptimization iteration based on any number and/or type of optimizationcriteria. The frame specification application 170 can determine when tore-generate the frame system specification 178 and/or acquire any amountand/or type of data that is relevant to the optimization criteria in anytechnically feasible fashion.

As depicted with a dashed arrow, in some embodiments, the framespecification application 170 re-generates the frame systemspecification 178 for a new design optimization iteration upon receivingthe building objective value 186 associated with the current designoptimization iteration as an input. In response to receiving thebuilding objective value 186, the frame specification application 170inputs the building objective value 186 into the genetic algorithm 550.

In the same or other embodiments, the genetic algorithm 550 implementsany number and/or types of search-based optimization operations based onthe building objective value 186 to re-determine the left frame counts572 and the right frame counts 574. The frame selection engine 580 thenre-generates the frame system specification 178 based on the left framecounts 572, the left frame groups 542, the right frame counts 574, andthe right frame groups 544.

The frame specification application 170 can determine when to ceaseoperating in any technically feasible fashion. For instance, in someembodiments, the frame specification application 170 ceases to operatein response to a termination command from the iterative optimizationapplication 172 or the structural design application 120. In the same orother embodiments, the frame specification application 170 ceases tooperate when the amount of time that has elapsed since the framespecification application 170 last received an input exceeds a maximumwait time.

Optimizing Sizing of Structural Members for Vertical and Lateral Loads

FIG. 6 is a more detailed illustration of the iterative sizingapplication 180 of FIG. 1, according to various embodiments. Forexplanatory purposes only, in the embodiment depicted in FIG. 6, thefunctionality of the iterative sizing application 180 is described inthe context of solving the vertical and lateral load design optimizationdescribed previously herein in conjunction with FIG. 1. Morespecifically, the iterative sizing application 180 adds or modifies theconnections between and sizing of the columns and beams in the gravitydesign 148 based on the frame system specification 178 and the objectivefunction 134 to generate the structural design 188 that resists deadloads, live loads, and the building wind load(s) included in thebuilding wind load data 162.

Note that the techniques described herein are illustrative rather thanrestrictive and can be altered without departing from the broader spiritand scope of the invention. In general, any number of instances of theiterative sizing application 180 can be executed in any technicallyfeasible fashion. The iterative sizing application 180 can modify theconnections between and/or the sizing of any types of structural membersin any type of design for a structural system of a building to generatethe structural design 188 that resists any number and/or types of loads.The iterative sizing application 180 can modify the connections and/orsizing in a design for a structural system based on any amount(including none) of data, any number and/or types of optimizationcriteria, and any number and/or types of the constraints 132.

As shown, in some embodiments, the iterative sizing application 180generates the structural design 188 and the building objective value 186based on the gravity design 148, the frame system specification 178, thedesign instructions 130, and the building wind load data 162. Thegravity design 148, the design instructions 130, and the building windload data 162 were described previously herein in conjunction withFIG. 1. The frame system specification 178 was described in detailpreviously herein in conjunction with FIG. 5.

In the same or other embodiments, the iterative sizing application 180includes, without limitation, a design initialization engine 620, astructural system iteration controller 630, a frame system iterationcontroller 650, and frame iteration engines 670(1)-670(R). Each of theframe iteration engines 670(1)-670(R) is a different instance of a frameiteration engine 670 (not explicitly shown). For explanatory purposesonly, the frame iteration engines 670(1)-670(R) are also referred toherein individually as “the frame iteration engine 670” and collectivelyas “the frame iteration engines 670.” As described in greater detailbelow, in some embodiments, R is a positive integer that the designinitialization engine 620 determines based on the frame systemspecification 178. In some other embodiments, the iterative sizingapplication 180 can include, without limitation, any number (includingone) of instances of the frame iteration engine 670.

As shown, in some embodiments, the design initialization engine 620initializes a structural design dataset 610 based on the gravity design148, the frame system specification 178, and the design instructions130. For explanatory purposes only, at any given point in time, thestructural design dataset 610 is also referred to herein as a “currentstructural design” of the building associated with the gravity design148.

The structural design dataset 610 can include, without limitation, anyamount and/or types of data relevant to generating the structural design188 and/or computing the building objective value 186. In someembodiments, the structural design dataset 610 includes, withoutlimitation, a building layout 612, sizing data 614, frame specifications616(1)-616(R), connection data 618, live load data 622, dead load data624, lateral load data 626, and the design instructions 130, where R canbe any positive integer.

The building layout 612 specifies, without limitation, locations, types,and materials of structural members included in the current structuraldesign. In some embodiments, the structural members include, withoutlimitation, any number of slabs, any number of beams, and any number ofcolumns. As depicted in italics, in some embodiments, the buildinglayout 612 is fixed and is therefore not modified by the iterativesizing application 180. The sizing data 614 specifies, withoutlimitation, any amount and/or type of sizing data for the structuralmembers include in the current structural design.

The frame specifications 616(1)-616(R) are also referred to hereinindividually as “the frame specification 622” and collectively as “theframe specifications 622.” In some embodiments, each of the framespecification 616 specifies a different frame (not shown), and theframes are collectively referred to herein as a “frame system” (notshown). In the same or other embodiments, the frame system correspondsto the frame system specifications 178(1,1). Accordingly, and asdescribed in greater detail below, in some embodiments, R is a positiveinteger that the design initialization engine 620 determines based onthe frame system specification 178(1,1).

Each of the frames specifications 616 specifies, without limitation, adifferent group of the structural members of the current design that areinterconnected via moment-resisting joints to form the correspondingframe. For instance, in some embodiments, each of the framespecifications 616 specifies, without limitation, any number of beamsand any number of columns that are interconnected via rigid joints.

The connection data 618 specifies any amount and/or type of dataassociated with connections between the structural members of thecurrent structural design. In some embodiments, the connection data 618specifies, without limitation, any number and/or types of joints thatare included in the current structural design. In the same or otherembodiments, the connection data 618 specifies, without limitation, arigid joint for each of the interconnections between the structuralmembers specified in each of the frame specifications 616.

The live load data 622 includes, without limitation, any number and/ortypes of live loads associated with the current structural design. Thelive load data 622 is fixed and is therefore not modified by theiterative sizing application 180. The dead load data 624 includes,without limitation, any number and/or types of dead loads associatedwith the current structural design. The lateral load data 626 includes,without limitation, any number and/or types of lateral loads associatedwith the current structural design. In some embodiments, the live loads,the dead loads, and the lateral loads included the live load data 622,the dead load data 624, and the lateral load data 626, respectively, canbe specified at any level of granularity with respect to the currentstructural design. For instance, in some embodiments, the live loads andthe dead loads are specified as distributed loads with respect tohorizontal areas (e.g., rooms).

In the same or other embodiments, the lateral load data 626 includes,without limitation, any number and/or types of member lateral loads (notshown). Each of the member lateral loads is associated with one of thestructural members of the current structural design and specifies,without limitation, any type of lateral load associated with thestructural member. In some embodiments, at any given time, the memberlateral loads can reflect the distribution of any number and/or types ofbuilding lateral loads (not shown) to each of the structural members.Each of the building lateral loads is a lateral load associated with thecurrent structural design and/or the associated building. In someembodiments, the building lateral loads include, without limitation, anynumber of building wind loads included in the building wind load data162.

The design initialization engine 620 can initialize the structuraldesign dataset 610 in any technically feasible fashion. In someembodiments, the design initialization engine 620 copies the designinstructions 130 to the structural design dataset 610. As describedpreviously herein, the design instructions 130 includes, withoutlimitation, the constraints 132, the objective function 134, the designvariable data 136, and the parameter data 138. In the same or otherembodiments, the design initialization engine 620 copies any amountand/or types of data from the gravity design 148 to initialize thebuilding layout 612 and the sizing data 614.

The design initialization engine 620 generates the frame specifications616 based on the gravity design 148 and the frame system specification178(1,1). The design initialization engine 620 can generate the framespecifications 616 in any technically feasible fashion. For instance, insome embodiments, the frame system specification 178 specifies alocation for each group of structural members in the gravity design148(1) that is to be interconnected via moment-resisting joints. Foreach of the locations specified in the frame system specification 178,the design initialization engine 620 identifies the corresponding groupof structural members in the current structural design and generates theframe specification 616 specifying, without limitation, the identifiedgroup of structural members. Accordingly, the total number of the framespecifications 616 is equal to the number of locations specified in theframe system specification 178.

In the same or other embodiments, the design initialization engine 620initializes the connection data 618 to specify, without limitation, anynumber and/or types of moment-resisting joints associated with theframes corresponding to the frame specifications 616. In someembodiments, for each of the frame specifications 616, the designinitialization engine 620 specifies via the connection data 618 thateach of the connections between the structural members specified in theframe specification 616 is a rigid joint. In the same or otherembodiments, the design initialization engine 620 specifies via theconnection data 618 that each connection between the structural membersin the current structural design that is not specified in the framespecifications 616 is a pin joint or a hinged joint.

In some embodiments, the design initialization engine 620 copies datafrom the gravity design 148 to initialize the live load data 622 and thedead load data 624. In other embodiments, the design initializationengine 620 computes the live load data 622 and the dead load data 624based on the building layout 612, the sizing data 614, and optionallythe design instructions 130. In some embodiments, the designinitialization engine 620 initializes the lateral load data 626 tospecify initial values of zero for each of any number and/or types ofmember lateral loads.

As indicated with double arrows, in some embodiments, the structuralsystem iteration controller 630, the frame system iteration controller650, and the frame iteration engines 670(1)-670(R) can read from, writeto, and/or modify the structural design dataset 610. In some otherembodiments, the iterative sizing application 180 can route any amountand/or types of data between the structural design dataset 610, thestructural system iteration controller 630, the frame system iterationcontroller 650, and the frame iteration engines 670(1)-670(R) in anytechnically feasible fashion.

In some embodiments, the iterative sizing application 180 defines andsolves a nested optimization problem to generate the structural design188(1,1). In some embodiments, solving the nested optimization problemcorresponds to optimizing the sizing data 614 included in the currentstructural design based on the objective function 134 and theconstraints 132 while taking into account gravity and any number and/ortype of building lateral load(s). In some embodiments, one or more ofthe constraints 132 are safety design factors that ensures that thestructural design 188 satisfactorily resists vertical loads and lateralloads.

In some embodiments, the structural system iteration controller 630executes any number of iterations included in a top loop to solve a toplayer of the nested optimization problem and thereby solve the nestedoptimization problem. As shown, in some embodiments, the structuralsystem iteration controller 630 includes, without limitation, astructural system iteration controller 640. In the same or otherembodiments, the structural system iteration controller 640 can readfrom, write to, and/or modify the structural design dataset 610. In someother embodiments, the structural system iteration controller 630 canroute any amount and/or types of data between the structural designdataset 610 and the structural system iteration controller 640 in anytechnically feasible fashion.

In some embodiments, to initiate each “top loop iteration,” thestructural system iteration controller 630 configures the structuralsystem iteration controller 640 to optimize the sizing data 614 basedthe objective function 134 and the constraints 132 while keeping thelateral load data 626 fixed. The structural system iteration controller640 can optimize the sizing data 614 for any number and/or type ofstructural members of the current design in any technically feasiblefashion.

In some other embodiments, the structural system iteration controller640 iteratively optimizes the beams in the current structural design andthen iteratively optimizes the columns in the current structural design,updating the dead load data 624 after each iteration while keeping thelateral load data 626 fixed. The structural system iteration controller640 can implement any number and/or type of optimization algorithmsand/or any number and/or types of fundamental rules that eachencapsulate any number and/or types of design and/or structuralengineering fundamentals. For instance, in some embodiments, thestructural system iteration controller 640 implements fully-stresseddesign methods to optimize the sizing data 614 for the beams and/or thecolumns in the current structural design.

In some other embodiments, the structural system iteration controller640 executes a bisection-based beam optimization algorithm thatiteratively optimizes the sizing data 614 for the beams based on theobjective function 134 and the constraints 132, updating the dead loaddata 624 after each iteration while keeping the lateral load data 626fixed. Subsequently, in some embodiments, the structural systemiteration controller 640 executes a bisection-based optimizationalgorithm to iteratively optimize the sizing data 614 for the columnsbased on the objective function 134 and the constraints 132, updatingthe dead load data 624 after each iteration while keeping the lateralload data 626 fixed.

In the same or other embodiments, after the structural system iterationcontroller 640 optimizes the sizing data 614 while keeping the lateralload data 626 fixed, the structural system iteration controller 630configures the frame system iteration controller 650 to solve a middlelayer of the nested optimization problem with respect to the top loopiteration. Solving the middle layer of the nested optimization problemcorresponds to optimizing the sizing data 614 for the frames specifiedvia the frame specifications 616 based on any number and/or type ofbuilding lateral loads. The sizing data 614 for the frames is the sizingdata 614 for the structural elements specified via the framespecifications 616. For explanatory purposes only, the sizing data 614for each of the frames is also referred to herein as a “sizing dataset.”

In some embodiments, the frame system iteration controller 650 includes,without limitation, a lateral load distribution engine 660. In someembodiments, the lateral load distribution engine 660 can read from,write to, and/or modify the structural design dataset 610. In some otherembodiments, the frame system iteration controller 650 can route anyamount and/or types of data between the structural design dataset 610and the lateral load distribution engine 660 in any technically feasiblefashion.

As shown, in some embodiments, the frame system iteration controller 650executes any number of iterations included in a middle loop to solve themiddle layer of the nested optimization problem with respect to the toploop iteration. In some embodiments, to initiate each “middle loopiteration,” the frame system iteration controller 650 configures thelateral load distribution engine 660 to distribute any number and/ortypes of building lateral load(s) across the frames corresponding to theframe specifications 616.

For instance, as depicted in italics, in some embodiments, the framesystem iteration controller 650 configures the lateral load distributionengine 660 to distribute any number of building wind loads (not shown)included in the building wind load data 162 across the framescorresponding to the frame specifications 616. In some embodiments, thebuilding wind load data 162 includes, without limitation, a differentbuilding wind load for each of any number of directions (e.g., the winddirections 164(1)-164(W)).

The lateral load distribution engine 660 can distribute the buildinglateral load(s) specified by the frame system iteration controller 650across the frames corresponding to the frame specifications 616 in anytechnically feasible fashion. In some embodiments, the lateral loaddistribution engine 660 applies any number and/or types of fundamentalrules that each encapsulate any number and/or types or structuralengineering fundamentals to the frame specifications 616 to distributethe building lateral load(s) across the corresponding frames. In thesame or other embodiments, the lateral load distribution engine 660distributes the building lateral load(s) across the frames based on thestiffnesses of the frames. In the same or other embodiments, for each ofthe frames, the lateral load distribution engine 660 generates one ormore frame lateral loads (not shown) that are associated with the frameand correspond to the portions of the building lateral load(s) that thelateral load distribution engine 660 distributes to the frame.Consequently, for each of the frames specifications 616, the framelateral load(s) specify the portions of the building lateral load(s)that the lateral load distribution engine 660 distributes to thecorresponding frame. The frame lateral load(s) are also referred toherein as “the frame-based lateral load(s).”

In some embodiments, after the lateral load distribution engine 660generates the frame lateral loads, the frame system iteration controller650 configures any number of instances of the frame iteration engine 670to solve a bottom layer of the nested optimization problem independentlyfor each of the frames specifications 616(1)-616(R) with respect to themiddle loop iteration. Solving the bottom layer of the nestedoptimization problem for each of the frame specifications 616corresponds to optimizing the sizing data 614 for the correspondingframe while holding the associated frame lateral load(s) fixed.

As shown, in some embodiments, the frame system iteration controller 650configures the frame iteration engines 670(1)-670(R) to independentlysolve the bottom layer of the optimization problem for each of the framespecifications 616(1)-616(R), respectively. In some other embodiments,the frame system iteration controller 650 configures less than Rinstances of the frame iteration engine 670 to independently solve thebottom layer of the optimization problem for each of the framespecifications 616(1)-616(R), respectively. For instance, in someembodiments, the frame system iteration controller 650 configures asingle instance of the frame iteration engine 670 to sequentially andsolve the bottom layer of the optimization problem for each of the framespecifications 616(1)-616(R).

In some embodiments, each instance of the frame iteration engine 670 canread from, write to, and/or modify the structural design dataset 610. Insome other embodiments, the frame system iteration controller 650 canroute any amount and/or types of data between the structural designdataset 610 and each instance of the frame iteration engine 670 in anytechnically feasible fashion.

To solve the bottom layer of the optimization problem for the framespecification 616, the frame iteration engine 670 can optimize thesizing data 614 for the structural elements specified in the framespecification 616 while holding the associated frame lateral loads fixedin any technically feasible fashion. As shown for the frame iterationengine 670(1), the frame iteration engine 670 includes, withoutlimitation, a frame iteration controller 672, a frame analyzer 680, anda lateral load resizing engine 690.

In some embodiments, the frame iteration controller 672 initiates anynumber of iterations included in a bottom loop to optimize the sizingdata 614 for the structural elements specified in the framespecification 616 while holding the frame lateral load(s) associatedwith the frame specification 616 fixed. In some embodiments, to initiateeach bottom loop iteration, the frame iteration controller 672 generatesa bending moment diagram 662 and a shear diagram 664 for the framecorresponding to the frame specification 616 based, at least in part, onthe frame lateral load(s). The frame analyzer 680 can generate thebending moment diagram 662 and the shear diagram 664 in any technicallyfeasible fashion.

In some embodiments, the frame analyzer 680 executes any number and/ortypes of frame analysis operations based on any number and/or types offundamental rules to generate the bending moment diagram 662 and theshear diagram 664. For instance, in some embodiments, the frame analyzer680 applies any number and/or types of fundamental rules to the framespecification 616 based on the frame lateral load(s) to compute apartial bending moment diagram (not shown) and a partial shear diagram(not shown). More specifically, in some embodiments, the frame analyzer680 applies the portal method, the equivalent column method, or themoment distribution method to the sizing data 614 for the structuralelements specified in the frame specification 616 based on the framelateral load(s) to generate the partial bending moment diagram and thepartial shear diagram.

Subsequently, in some embodiments, the frame analyzer 680 determines anynumber and/or types of vertical loads associated with the framecorresponding to the frame specification 616 based on the live load data622 and the dead load data 624. The frame analyzer 680 then uses themethod of superposition to generate the bending moment diagram 662 forthe frame corresponding to the frame specification 616 based on thevertical loads associated with the frame and the partial bending momentdiagram. In the same or other embodiments, the frame analyzer 680 usesthe fundamental rule associated with the method of superposition togenerate the shear diagram 664 for the frame corresponding to the framespecification 616 based on the vertical loads associated with the frameand the partial shear diagram.

In some embodiments, the lateral load resizing engine 690 optimizes thesizing data 614 for the structural elements specified in the framespecification 616 based the bending moment diagram 662, the sheardiagram 664, the objective function 134 and the constraints 132. Thelateral load resizing engine 690 can optimize the sizing data 614 forthe structural elements specified in the frame specification 616 in anytechnically feasible fashion.

For instance, in some embodiments, the lateral load resizing engine 690executes a bisection-based frame optimization algorithm that jointlyoptimizes the sizing data 614 for the beams and the columns specified inthe frame specification 616. During each of any number of iterations,the bisection-based frame optimization algorithm updates the sizing data614 for the beams and the columns based on the bending moment diagram662, the shear diagram 664, the objective function 134 and theconstraints 132. In the same or other embodiments, the lateral loadresizing engine 690 can optimize the sizing data 614 for the structuralelements specified in the frame specification 616 while holding theassociated frame lateral load(s) fixed in any technically feasiblefashion.

In some embodiments, after the lateral load resizing engine 690optimizes the sizing data 614 for the beams and the columns specified inthe frame specification 616, the associated bottom loop iteration iscomplete. In some embodiments, the lateral load resizing engine 690 orthe frame iteration controller 672 updates the dead load data 624 andthe member lateral loads to reflect any changes to the sizing data 614for the beams and the columns specified in the frame specification 616.The frame iteration controller 672 can determine whether to initiateanother bottom loop iteration in any technically feasible fashion.

In some embodiments, if a maximum number of bottom loop iterations (notshown) has been reached for the frame specification 616, then the frameiteration controller 672 does not initiate another bottom loopiteration. In the same or other embodiments, the frame iterationcontroller 672 determines whether to initiate another bottom loopiteration based, at least in part, the magnitude of any changes to thesizing data 614 of the structural members specified in the framespecification 616 between bottom loop iterations.

In some embodiments, if the frame iteration controller 672 determinesthat the relevant sizing options have been explored, then the frameiteration controller 672 does not initiate another bottom loopiteration. The frame iteration controller 672 can determine whether therelevant sizing options have been explored in any technically feasiblefashion. For instance, in some embodiments, the frame iterationcontroller 672 determines that the relevant sizing operations have beenexplored when each of the structural elements specified in the framespecification 616 is at the maximum allowed size as per the designvariable data 136.

As depicted with a dashed arrow, if the frame iteration controller 672does not initiate another bottom loop iteration, then the frameiteration controller 672 indicates to the frame system iterationcontroller 650 that the bottom loop for the frame specification 616 iscomplete in any technically feasible fashion. In some embodiments, whenthe bottom loop for the frame specification 616 is complete, the frameiteration engine 670 has solved the bottom layer of the nestedoptimization problem for the frame corresponding to the framespecification 616 with respect to the middle loop iteration.

After the instances of the frame iteration engine 670 have completed thebottom loops for the frames specifications 616(1)-616(R), the framesystem iteration controller 650 optionally executes any number ofoptimization and/or refinement operations on based on the framespecifications 616. For instance, as persons skilled in the art willrecognize, if a centroid of the building wind loads does not align witha shear centroid of the current structural design, then the resultingeccentricity causes unbalanced torsional forces when the building windload(s) are applied on the building. Accordingly, in some embodiments,the frame system iteration controller 650 implements one or moretechniques to reduce the eccentricity of the building wind load(s)included in the building wind load data 162.

For instance, in some embodiments, the frame system iteration controller650 implements a different instance of aproportional-integral-derivative (“PID”) controller (not shown) for eachof the floors in the building. The PID controller links the magnitude ofunbalanced torsional forces with a safety factor correction of the beamsand the columns specified in the frame specifications 616. Morespecifically, each instance of the PID controller corrects a designsafety factor (not shown) included in the constraints 132 based on anyunbalanced torsional force for the associated floor. Correcting thestiffness safety factor causes the lateral load resizing engine 690 toartificially strengthen some of the frames corresponding to the framespecifications 616 such that a distance between the the centroid of thebuilding wind loads and the shear centroid of the current structuraldesign is reduced. In the same or other embodiments, the frame systemiteration controller 650 implements a different instance of a PIDcontroller for each level of each frame. For a given building wind load,the PID controllers overdesign frames that are located on the weakerside (e.g., in the left frame group 542 or the right frame group 544) ofthe building with respect to the building wind load.

After the frame system iteration controller 650 optionally executes anynumber of optimization and/or refinement operations on the framespecifications 616, the middle loop iteration is complete. The framesystem iteration controller 650 then determines whether to initiateanother middle loop iteration. The frame system iteration controller 650can determine whether to initiate another middle loop iteration in anytechnically feasible fashion. For instance, in some embodiments, if amaximum number of middle loop iterations (not shown) has been reached,then the frame system iteration controller 650 does not initiate anothertop loop iteration. In the same or other embodiments, the frame systemiteration controller 650 determines whether to initiate another middleloop iteration based, at least in part, the magnitude of any changes tothe sizing data 614 of the structural members specified in the framespecifications 616 and/or the magnitude of any changes in the framelateral loads between middle loop iterations. In some embodiments, ifthe frame system iteration controller 650 determines that the relevantsizing options have been explored, then the frame system iterationcontroller 650 does not initiate another bottom loop iteration.

As depicted with a dashed arrow, if the frame system iterationcontroller 650 does not initiate another middle loop iteration, then theframe system iteration controller 650 indicates to the structural systemiteration controller 630 that the middle loop is complete. In someembodiments, when the middle loop is complete, then the frame systemiteration controller 650 has solved the middle layer of the nestedoptimization problem for the frame system with respect to the top loopiteration.

The structural system iteration controller 630 then determines whetherto initiate another top loop iteration. The structural system iterationcontroller 630 can determine whether to initiate another top loopiteration in any technically feasible fashion. For instance, in someembodiments, if a maximum number of top loop iterations (not shown) hasbeen reached, then the structural system iteration controller 630 doesnot initiate another top loop iteration. In the same or otherembodiments, the structural system iteration controller 630 determineswhether to initiate another top loop iteration based, at least in part,the magnitude of any changes to the sizing data 614 between top loopiterations. In some embodiments, if the structural system iterationcontroller 630 determines that the relevant sizing options have beenexplored, then the frame system iteration controller 650 does notinitiate another bottom loop iteration.

If the structural system iteration controller 630 does not initiateanother top loop iteration, then the top loop is complete. In someembodiments, when the top loop is complete, the structural systemiteration controller 630 has solved the nested optimization problem. Asshown, the structural system iteration controller 630 then generates thestructural design 188 based on the structural design dataset 610. Insome embodiments, the structural system iteration controller 630computes the building objective value 186 for the structural design 188based on the objective function 134. In the same other embodiments, thestructural system iteration controller 630 can compute any number and/ortype of values for any number and/or types of other metrics associatedwith any number and/or types of design objectives.

In some embodiments, the iterative sizing application 180 transmits thestructural design 188 and/or the building objective value 186 to anynumber of other software applications in any technically feasiblefashion. In the same or other embodiments, the iterative sizingapplication 180 stores the structural design 188 and/or the buildingobjective value 186 in a memory that is accessible to at least one othersoftware application. In some embodiments, iterative sizing application180 stores the building objective value 186 in a memory that isaccessible to the iterative optimization application 172, and theiterative optimization application 172 inputs the building objectivevalue 186 into the frame specification application 170(1,1).

Many modifications and variations will be apparent to those of ordinaryskill in the art without departing from the scope and spirit of thedescribed embodiments. For instance, in some embodiments, the gravitydesign 148 specifies a reinforced cement concrete frame structuralsystem. As persons skilled in the art will recognize, the beams andcolumns in a reinforced concrete frame structural system are typicallyconnected via rigid joints and therefore the frame system specification178 is superfluous. In some embodiments, if the frame systemspecification 178 is not inputted into the iterative sizing application180, then the design initialization engine 620 generates the framespecifications 616 specifying frames at all appropriate locations of thegravity design 148. In the same or other embodiments, if the framesystem specification 178 is not inputted into the iterative sizingapplication 180 and the gravity design 148 specifies the vertical loads,then the iterative sizing application 180 does not execute thestructural system iteration controller 630 prior to executing the firststructural system design iteration.

It will be appreciated that the instance of the iterative sizingapplication 180 depicted in and described in conjunction with FIG. 6 isillustrative and that variations and modifications to the iterativesizing application 180 are possible. For example, the functionalityprovided by the iterative sizing application 180 as described herein maybe integrated into or distributed across any number of components of theiterative sizing application 180. Further, the connection topologybetween the various components of the iterative sizing application 180can be modified as desired.

For instance, in some embodiments, the iterative sizing application 180omits the design initialization engine 620 and/or the structural designdataset 610, and the iterative sizing application 180 can determineand/or route any amount and/or types of data to, between, and from anynumber of components in any technically feasible fashion. In someembodiments, the iterative sizing application 180 receives the gravitydesign 148, the frame system specification 178, the design instructions130, and any number and/or types of building lateral loads in anytechnically feasible fashion. In response, the iterative sizingapplication 180 generates an initial structural design (not shown) basedon the gravity design 148 and the frame system specification 178. Theiterative sizing application 180 then configures the structural systemiteration controller 630, the frame system iteration controller 650 andthe frame iteration engines 670 to collaboratively optimize the initialstructural design based on the design instructions 130 and the buildinglateral load(s).

FIGS. 7A-7B set forth a flow diagram of method steps for generating atleast one design of a structural system of a building, according tovarious embodiments. Although the method steps are described withreference to the systems of FIGS. 1-3, persons skilled in the art willunderstand that any system configured to implement the method steps, inany order, falls within the scope of the present invention.

As shown, a method 700 begins a step 702, where the design conceptengine 220 generates the floor structure template 222 for each floor ofthe structural system of the building based on the building plan 124.The gravity design application 140 then selects the first floor. At step704, the partitioning engine 224 partitions the floor structure template222 for the selected floor into any number of the segments 230 and thenselects the first of the segments 230 of the selected floor.

At step 706, the layout variation engine 250 generate multiple of thepartial designs 258 for the selected segment 230. At step 708, thegravity design optimizer 260 optimizes the partial designs 258 of theselected segment 230 based on the constraints 132 and the objectivefunction 134 to generate the optimized partial designs 268 for theselected segment 230. At step 710, the segment design ranking engine 270ranks the optimized partial designs 268 for the selected segment 230based on the objective function 134 generate the ranked segment designlist 278 for the selected segment 230.

At step 712, the partitioning engine 224 determines whether the selectedsegment 230 is the last of the segments 230 that are associated with theselected floor. If, at step 712, the partitioning engine 224 determinesthat the selected segment 230 is not the last of the segments 230 thatare associated with the selected floor, then the method 700 proceeds tostep 714. At step 714, the partitioning engine 224 selects the next ofthe segments 230 that are associated with the selected floor, and themethod 700 returns to the step 706, where the layout variation engine250 generate multiple of the partial designs 258 for the selectedsegment 230.

If, however, at step 712, the partitioning engine 224 determines thatthe selected segment 230 is the last of the segments 230 that areassociated with the selected floor, then the method 700 proceedsdirectly to step 716. At step 716, the incremental merging engine 280performs incremental per-segment merging and optimization operationsacross the ranked segment design lists 278 associated with the selectedfloor to generate the ranked floor design list 288 for the selectedfloor

At step 718, the gravity design application 140 determines whether theselected floor is the last floor. If, at step 718, the gravity designapplication 140 determines that the selected floor is not the lastfloor, then the method 700 proceeds to step 720. At step 720, thegravity design application 140 selects the next floor, and the method700 returns to step 704, where the partitioning engine 224 partitionsthe floor structure template 222 for the selected floor.

If, however, at step 718, the gravity design application 140 determinesthat the selected floor is the last floor, then the method 700 proceedsdirectly to step 722. At step 722, the multi-floor optimizer 290performs one or more search operations on the ranked floor design lists288 based on the objective function 134 to generate the gravity designs148. At step 724, multi-floor optimizer 290 computes the gravity designobjective values 146 based on the gravity designs 148 and the objectivefunction 134. At step 726, the gravity design application 140 storesand/or transmits any number of the gravity designs 148 and/or thegravity design objective values 146 to any number of softwareapplication for use in further design activities. The method 700 thenterminates.

For explanatory purposes only, the method steps of the method 700 aredepicted and described as occurring sequentially. However, as personsskilled in the art will recognize, the steps 704-720 can be performedsequentially, concurrently, or in any combination thereof for each ofthe floors Similarly, the steps 706-714 can be performed sequentially,concurrently, or in any combination thereof for each of the segments230.

FIGS. 8A-8B set forth a flow diagram of method steps for generating aframe grid for a structural system of a building, according to variousembodiments. Although the method steps are described with reference tothe systems of FIGS. 1-4, persons skilled in the art will understandthat any system configured to implement the method steps, in any order,falls within the scope of the present invention.

As shown, a method 800 begins a step 802, where the grid generationapplication 150 acquires the gravity designs 148 and optionally thegravity design objective values 146 that are associated with the gravitydesigns 148. At step 804, the grid generation application 150 generatesthe edge set 402 based on the gravity designs 148. Each of the edgesincluded in the edge set 402 corresponds to a different beam that isconnected to at least one column.

At step 806, the base direction engine 410 generates the weighteddirection set 412 based on the directions of the edges included in theedge set 402. At step 808, the direction clustering engine 420 performsany number and/or types of clustering operations on the weighteddirections included in the weighted direction set 412 to generate thedirection cluster sets 428. At step 810, the direction clustering engine420 performs any number and/or types of ranking and/or filteringoperations on the direction cluster sets 428 to generate the rankeddirection cluster set list 408.

At step 812, for each of any number of the direction cluster sets 428having the highest ranking as per the ranked direction cluster set list408, the grid generation application 150 generates the base directionset 436 based on the direction clusters included in the directioncluster set 428. At step 814, the grid generation application 150selects a first of the base direction sets 436.

At step 816, the grid equation engine 440 generates the weightedequation set 442 based on equations representing the edges included inthe edge set 402. At step 818, the equation partitioning engine 450determines the weighted equation subset 458 from the weighted equationset 442 for each of the base directions 438 specified in the selectedbase direction set 436. At step 820, the grid equation engine 440selects a first of the weighted equation subsets 458 that are associatedwith the selected base direction set 436.

At step 822, the grid equation engine 440 performs any number and/ortypes of clustering operations on the weighted equations included in theselected one of the weighted equation subsets 458 to generate one ormore of the equation cluster sets. At step 824, the grid equation engine440 performs any number and/or types of ranking and/or filteringoperations on the equation cluster sets. to generate the ranked equationcluster set list 468 for the base direction 438 that is associated withthe selected one of the weighted equation subsets 458.

At step 826, the grid equation engine 440 determines whether theselected one of the weighted equation subsets 458 is the last of theweighted equation subsets 458 that is associated with the selected basedirection set 436. If, at step 826, the grid equation engine 440determines that the selected one of the weighted equation subsets 458 isnot the last of the weighted equation subsets 458 that is associatedwith the selected base direction set 436, then the method 800 proceedsto step 828.

At step 828, the grid equation engine 440 selects the next of theweighted equation subsets 458 that are associated with the selected basedirection set 436, and the method 800 returns to step 822, where thegrid equation engine 440 generates one or more of new equation clustersets. The method 800 continues to cycle though steps 822-828 until, atstep 826, the grid equation engine 440 determines that the selected oneof the weighted equation subsets 458 is the last of the weightedequation subsets 458 that is associated with the selected base directionset 436.

If, at step 826, the grid equation engine 440 determines that theselected one of the weighted equation subsets 458 is the last of theweighted equation subsets 458 that is associated with the selected basedirection set 436, then the method 800 proceeds direction to step 830.At step 830, the grid specification engine 490 generates any number ofthe frame grids 158 based on the ranked equation cluster set list 468for the selected one of the weighted equation subsets 458.

At step 832, the grid generation application 150 determines whether theselected base direction set 436 is the last of the base direction sets436. If, at step 832, the grid generation application 150 determinesthat the selected base direction set 436 is not the last of the basedirection sets 436, then the method 800 proceeds to step 834. At step834, the grid generation application 150 selects the next of the basedirection sets 436, and the method 800 returns to step 818, where theequation partitioning engine 450 determines the weighted equationsubsets 458 based on the selected base direction set 436. The method 800continues to cycle though steps 818-834 until, at step 822, the gridgeneration application 150 determines that the selected base directionset 436 is the last of the base direction sets 436.

If, at step 822, the grid generation application 150 determines that theselected base direction set 436 is the last of the base direction sets436, then the method 800 proceeds direction to step 836. At step 836,the grid generation application 150 stores and/or transmits any numberof the frame grids 158 to any number of software application for use infurther design activities. The method 800 then terminates.

For explanatory purposes only, the method steps of the method 800 aredepicted and described as occurring sequentially. However, as personsskilled in the art will recognize, the steps 814-834 can be performedsequentially, concurrently, or in any combination thereof for each ofthe base direction sets 436 Similarly, the steps 820-828 can beperformed sequentially, concurrently, or in any combination thereof foreach of the weighted equation subsets 458.

FIG. 9 is a flow diagram of method steps for generating a design for aframe system associated with a building, according to variousembodiments. Although the method steps are described with reference tothe systems of FIGS. 1-5, persons skilled in the art will understandthat any system configured to implement the method steps, in any order,falls within the scope of the present invention.

As shown, a method 900 begins a step 902, where the wind directionallocation engine 510 determines the potential frame location set 514for each of the wind directions 164 based on the gravity design 148 fora building, the frame grid 158. At step 904, the wind directionallocation engine 510 computes the building load centroid 520 for thebuilding based on the gravity design 148.

At step 906, for each of the wind directions 164(w), where w is aninteger from 1 to W, the frame partitioning engine 530 bifurcates thepotential frame location set 514(w) into the left frame group 542(w) andthe right frame group 544(w) based on the building load centroid 520. Atstep 908, the frame specification application 170 implements the geneticalgorithm 550 that has two design variables for each of the winddirections 164(w)—the left frame count 572(w) and the right frame count574(w).

At step 910, the frame specification application 170 causes the geneticalgorithm 550 to determine the left frame counts 572 and the right framecounts 574. At step 912, for each of the wind directions 164(w), theframe selection engine 580 selects from the left frame group 542(w) theleft frame count 572(w) of locations furthest from the building loadcentroid 520. At step 914, for each of the wind directions 164(w), theframe selection engine 580 selects from the right frame group 544(w) theright frame count 574(w) of locations furthest from the building loadcentroid 520.

At step 916, the frame selection engine 580 generates the frame systemspecification 178 indicating that a frame system includes, withoutlimitation, frames at the selected locations. At step 918, the framespecification application 170 stores and/or provides the frame systemspecification 178 to any number of software applications for use infurther design activities.

At step 920, the frame specification application 170 determines whetherthe frame specification application 170 acquires the building objectivevalue 186 associated with the frame system specification 178. If at step920, the frame specification application 170 determines that the framespecification application 170 does not acquire the building objectivevalue 186, then the method 900 terminates.

If, however, at step 920, the frame specification application 170determines that the frame specification application 170 acquires thebuilding objective value 186, then the method 900 proceeds to step 922.At step 922, the frame specification application 170 causes the geneticalgorithm 550 to re-determine the left frame counts 572 and the rightframe counts 574 based on the building objective value 186. The method900 then returns to step 912, where the frame selection engine 580selects locations from the left frame groups 542 and the right framegroups 544 based on the left frame counts 572 and the right frame counts574.

The method 900 continues to cycle though steps 912-922 until, at step920, the frame specification application 170 determines that the framespecification application 170 does not acquire the building objectivevalue 186. The method 900 then terminates.

FIGS. 10A-10B set forth a flow diagram of method steps for designing astructural system of a building to resist a lateral load, according tovarious embodiments. Although the method steps are described withreference to the systems of FIGS. 1-6, persons skilled in the art willunderstand that any system configured to implement the method steps, inany order, falls within the scope of the present invention.

As shown, a method 1000 begins a step 1002, where the designinitialization engine 620 generates the structural design dataset 610that specifies, without limitation, the frame system 606 based on thegravity design 148 and the frame system specification 178. Thestructural system iteration controller 630 then initializes the memberlateral loads to zero. At step 1004, the structural system iterationcontroller 640 sequentially optimizes the sizing of the beams and thecolumns specified in the structural design dataset 610 based on theconstraints 132 and the objective function 134 while holding the memberlateral loads fixed.

At step 1006, the lateral load distribution engine 660 distributes oneor more building lateral loads the building wind loads included in thebuilding wind load data 162) across the frames corresponding to theframe specifications 616 to determine any number of frame lateral loadsfor each of the frames. The frame system iteration controller 650 thenselects the frame corresponding to the frame specification 616(1).

At step 1008, the frame analyzer 680 generates the bending momentdiagram 662 and the shear diagram 664 for the selected frame based onthe associated frame lateral load(s) and the associated vertical loads.At step 1010, the lateral load resizing engine 690 jointly optimizes thesizing of the beams and the columns in the selected frame based on thebending moment diagram 662, the shear diagram 664, the constraints 132and the objective function 134.

At step 1012, the frame iteration controller 672 determines whether theframe iteration controller 672 has finished optimizing the selectedframe. If, at step 1012, the frame iteration controller 672 determinesthat the frame iteration controller 672 has not finished optimized theselected frame, then the method 1000 returns to step 1008, where theframe analyzer 680 re-generates the bending moment diagram 662 and theshear diagram 664 for the selected frame.

If, however, at step 1012, the frame iteration controller 672 determinesthat the frame iteration controller 672 has finished optimized theselected frame, then the method 1000 proceeds direction to step 1014. Atstep 1014, the frame system iteration controller 650 determines whetherthe selected frame corresponds to the last of the frames specifications616. If, at step 1014, the frame system iteration controller 650determines that the selected frame does not correspond to the last ofthe frame specifications 616, then the method 1000 proceeds to step1016.

At step 1016, the frame iteration controller 672 selects the framecorresponding to the next of the frame specifications 616. The method1000 then returns to step 1008, where the frame analyzer 680re-generates the bending moment diagram 662 and the shear diagram 664for the selected frame. The method 1000 continues to cycle though steps1008-1016 until, at step 1014, the frame iteration controller 672determines that the selected frame corresponds to the last of the framespecifications 616.

If, at step 1014, the frame iteration controller 672 determines that theselected frame corresponds to the last of the frame specifications 616,then the method 1000 proceeds directly to step 1018. At step 1018, theframe system iteration controller 650 determines whether the framesystem iteration controller 650 has finished optimizing the framesystem.

If, at step 1018, the frame system iteration controller 650 determinesthat the frame system iteration controller 650 has not finishedoptimizing the frame system, then the method 1000 returns to step 1006,where the lateral load distribution engine 660 re-distributes thebuilding lateral loads across the frames corresponding to the framespecifications 616. The method 1000 continues to cycle though steps1006-1018 until, at step 1018, the frame system iteration controller 650determines that the frame system iteration controller 650 has finishedoptimizing the frame system.

If, at step 1018, the frame system iteration controller 650 determinesthat the frame system iteration controller 650 has finished optimizingthe frame system, then the method 1000 proceeds to step 1020. At step1020, the structural system iteration controller 630 determines whetherthe structural system iteration controller 630 has finished optimizingthe structural design dataset 610.

If, at step 1020, the structural system iteration controller 630determines that the structural system iteration controller 630 has notfinished optimizing the structural design dataset.610, then the method1000 returns to step 1004, where the structural system iterationcontroller 640 sequentially optimizes the sizing of the beams and thecolumns in the structural design dataset 610 while holding the memberlateral loads fixed. The method 1000 continues to cycle though steps1004-1020 until, at step 1020, the structural system iterationcontroller 630 determines that the structural system iterationcontroller 630 has finished optimizing the structural design dataset.610,

If, at step 1020, the structural system iteration controller 630determines that the structural system iteration controller 630 hasfinished optimizing the structural design dataset. 610, then the method1000 proceeds to step 1022. At step 1022, the structural systemiteration controller 630 generates the structural design 188 based onthe structural design dataset. 610 and optionally computes the buildingobjective value 186 for the structural design 188. At step 1024, theiterative sizing application 180 stores and/or transmits the structuraldesign 188 and/or the building objective value 186 to any number ofother software applications in any technically feasible fashion. Themethod 1000 then terminates.

For explanatory purposes only, the method steps of the method 1000 aredepicted and described as occurring sequentially. However, as personsskilled in the art will recognize, the steps 1008-1016 can be performedsequentially, concurrently, or in any combination thereof for each ofthe frames corresponding to the frame specifications 616

In sum, the disclosed techniques can be used to efficiently generatedesigns for a structural system of a building based on a building plan,any number and type of constraints, an objective function thatencapsulates any number and/or types of design objectives, and one ormore building wind loads. In some embodiments, a structural designapplication breaks the overall design optimization problem intomultiple, less complex constituent optimization problems associated withdifferent aspects of the structural system. The structural designapplication executes an overall design flow that dynamicallyself-adjusts based on results generating while solving the constituentoptimization problems to generate a ranked structural design list forthe structural system. The ranked structural design list specifies anynumber of structural designs for the structural system of the buildingand the corresponding values of the objective function or “buildingobjective values.” Each of the designs is optimized based on theconstraints, the objective function, gravity, and the building windloads. The structural designs are listed in the ranked structural designlist in descending order of degree of convergence with the designobjectives as per the building objective values.

To initiate the overall design flow, the structural design applicationconfigures a gravity design application to generate a specified numberof gravity designs based on the building plan, the constraints, and theobjective function. Each of the gravity designs specifies, withoutlimitation, locations, types, materials, and sizing of any number ofslabs, any number of beams, and any number of columns. Notably, each ofthe gravity designs is optimized based on the constraints, and theobjective function while taking into account gravity but not thebuilding wind loads.

The gravity design application implements a branch-merge design flow togenerate the gravity designs. During the branching phase, the gravitydesign application partitions each floor of the structural system intomultiple segments and then implements a rule-based expert system togenerate a variety of segments layouts for each of the segments. Each ofthe segment layouts specifies, without limitation, locations, types, andmaterials for any number of slabs, any number of beams, and any numberof columns.

The gravity design application configures a gravity design optimizer toindependently optimize sizing data for each of the segment layouts togenerate optimized segment designs. To optimize the sizing data for agiven segment layout, the gravity design application sequentiallyoptimizes the sizing data for the constituent slabs, beams, and columnsbased on the constraints and the objective function while taking intoaccount gravity (as live loads and dead loads) but not the building windloads. The gravity design application also computes objective values foreach of the segment designs based on the objective function. For eachsegment, the gravity design application ranks the associated segmentdesigns based on the objective values to generate a ranked segmentdesign list. The ranked segment design list for a given segmentincludes, without limitation, the N highest ranked segment designs forthe segment and the associated objective values, where N is a parametervalue that can be any positive integer.

During the merging phase, the gravity design application generatesmultiple floor designs for each floor based on the associated rankedsegment design lists. For a given floor, the gravity design applicationperforms per-segment, incremental merging based on the associated rankedsegment design lists. After each incremental merge, the gravity designapplication configures the gravity design optimizer to optimize theresulting merged design and compute the associated objective value.After performing the final per-segment incremental merge, the gravitydesign application generates a ranked floor design list for the floorthat includes, without limitation, N designs for the associated floorand the associated objective values. The N designs for the associatedfloors are the N highest ranked optimized merged designs of the subsetof the optimized merged layouts that represent the entire floor. Thegravity design application then implements a genetic algorithm thatsearches the ranked floor design lists for the different floors togenerate N different gravity designs for the structural system.

Subsequently, the structural design application configures a gridgeneration application to generate any number of frame grids based onthe N gravity designs. Each frame grid includes, without limitation, anynumber of grid lines along which lateral load resisting frames are to bealigned. For each of the gravity designs, the grid generationapplication selects the beams that are connected to at least one columnand generates an edge set that includes, without limitation, a differentedge for each of the selected beams. The grid generation applicationthen generates a weighted direction set based on the directions of theedges included in the edge set. The grid generation application executesa K-means clustering algorithm on the weighted direction set multipletimes based on different combinations of seedings and number of clustersto generate different direction cluster sets. Subsequently, the gridgeneration application applies an elbow method heuristic to thedirection cluster sets to determine an elbow point and ranks thedirection cluster sets based on the distances to the elbow point togenerate a ranked direction cluster set list. For each cluster includedin the highest ranked direction cluster set, the grid generationapplication generates a base direction that is equal to the directionassociated with the centroid of the cluster.

The grid generation application generates a weighted equation set basedon the equations of the edges included in the edge set and the objectivevalues of the associated gravity designs. For each of the basedirections, the grid generation application determines a correspondingweighted equation subset that includes, without limitation, the weightedequations that are approximately parallel to the base direction. Foreach of the weighted equation subsets, the grid generation applicationuses the K-mean clustering algorithm and the elbow method heuristic togenerate a ranked equation cluster set list. The grid generationapplication then generates any number of frame grids based on the rankedequation cluster set lists. For each of the base directions, each framegrid includes, without limitation, one or more grid lines that areapproximately parallel to the base direction.

For each unique combination of one of the gravity designs and one of theframe grids, the structural design application configures a differentinstance of an iterative optimization application to generate adifferent structural design for the structural system and an associatedbuilding objective value. Each structural design for the structuralsystem is optimized based on the constraints and the objective functionwhile taking into account gravity and the building wind loads.

Each instance of the iterative optimization application includes,without limitation, a different instance of a frame specificationapplication and a different instance of an iterative sizing application.In operation, the iterative optimization application executes any numberof design optimization iterations via the frame specificationapplication and the iterative sizing application.

To execute a first design optimization iteration, the iterativeoptimization application inputs a gravity design, a frame grid, and anynumber of wind directions into the frame specification application. Inresponse, the frame specification application generates a frame systemspecification that specifies, without limitation, locations for at leastone frame that provides lateral resistance for each wind direction.Subsequently, the iterative optimization application inputs the gravitydesign, the frame system specification, the building wind loads, theconstraints, and the objective function into the iterative sizingapplication. In response, the iterative optimization applicationgenerates a first version of a structural design and computes theassociated building objective value.

To execute each of any number of subsequent design optimizationiterations, the iterative optimization application inputs the buildingobjective value computed during the prior design optimization iterationinto the frame specification application. In response, the framespecification application re-generates the frame system specification.Subsequently, the iterative optimization application inputs the gravitydesign, the re-generated frame system specification, the building windloads, the constraints, and the objective function into the iterativesizing application. In response, the iterative optimization applicationgenerates a new version of the structural design and computes theassociated building objective value.

During the first design optimization iteration, for each of the winddirections, the frame specification application generates a differentpotential frame location set based on the frame grid and the gravitydesign. Each of the potential frame location sets includes, withoutlimitation, the locations of a different subset of potential frames withrespect to the gravity design, where the subsets are mutually exclusive.Based on the gravity design, the frame specification application sets abuilding load centroid equal the total dead load across all the floorsof the building. For each of the wind directions, the framespecification application then bifurcates the associated potential framelocation set into a left frame group and a right frame group based onthe building load centroid.

The frame specification application configures a genetic algorithm toiteratively and collectively optimize left frame counts and right framecounts for the left frame groups and the right frame groups,respectively, based on the building objective value associated with theprior iteration (and computed by the iterative sizing application). Eachof the left frame counts is a design variable of the genetic algorithmthat can range from 1 to the total number of locations in the associatedleft frame group. Similarly, each of the right frame counts is a designvariable of the genetic algorithm that can range from 1 to the totalnumber of locations in the associated right frame group.

Still during the first design iteration, the frame specificationapplication causes the genetic algorithm to randomly determine the leftframe counts and the right frame counts. For each of the left framegroups, the frame specification application selects the associated leftframe count of locations from the left frame group in order ofdecreasing distance from the building load centroid. Similarly, for eachof the right frame groups, the frame specification application selectsthe associated right frame count of locations from the right frame groupin order of decreasing distance from the building load centroid. Theframe specification application then generates the frame systemspecification that includes, without limitation, the selected locations.

During each subsequent design optimization iteration, the framespecification application receives the building objective value that iscomputed by the iterative sizing application during the prior designoptimization iteration. The frame specification application inputs thebuilding objective value into the genetic algorithm. In response, thegenetic algorithm re-determines the left frame counts and the rightframe counts. Based on the left frame counts and the right frame counts,the frame specification application re-generates the frame systemspecification.

During each design optimization iteration, the iterative sizingapplication generates a structural design based on the gravity design,the frame system specification associated with the design optimizationiteration, the constraints, the objective function, and the buildingwind loads. The structural design specifies a structural system thatresists live loads, dead loads, and the building wind loads as per anynumber of the constraints. The iterative sizing application alsocomputes the building objective value for the structural design based onthe objective function.

In operation, the iterative sizing application modifies the gravitydesign based on the frame system specification to generate a currentstructural design that includes, without limitation, a frame system.Each of any number of frames specifications derived from the framesystem specifications specifies, without limitation, a group of one ormore beams and one or more columns included in the current structuraldesign that are interconnected via rigid joints. The iterative sizingapplication also initializes the member lateral loads for the slabs,beams, and columns of the current structural design to zero.

Subsequently, the iterative sizing application defines and solves anested optimization problem to optimize the sizing of the beams and thecolumns included in the current structural design based on the objectivefunction, the constraints, gravity, and the building wind loads. Theiterative sizing application includes, without limitation, a structuralsystem iteration controller, a frame system iteration controller, and aframe iteration engine.

The structural system iteration controller executes any number of toploop iterations to solve a top layer of the nested optimization problemand thereby solve the nested optimization problem. To initiate a toploop iteration, the structural system iteration controller executes agradient-based beam optimization algorithm that iteratively optimizesthe sizing data for the beams based on the objective function and theconstraints, updating the dead loads after each iteration while keepingthe member wind loads fixed. Subsequently, the structural systemiteration controller executes a gradient-based column optimizationalgorithm that iteratively optimizes the sizing data for the columnsbased on the objective function and the constraints, updating the deadloads after each iteration while keeping the member wind loads fixed.

The frame system iteration controller then configures the frame systemiteration controller to execute any number of middle loop iterations tosolve a middle layer of the nested optimization problem with respect tothe top loop iteration. Solving the middle layer of the nestedoptimization problem corresponds to optimizing the sizing of the columnsand beams in the frame system based on the building wind loads.

To initiate each middle loop iteration, the frame system iterationcontroller distributes the building wind loads across the framesincluded in the current structural design to generate one or more framelateral loads for each of the frames. For each of the frames, the framesystem iteration controller configures a different instance of the frameiteration engine to independently solve a bottom layer of the nestedoptimization problem with respect to the middle loop iteration. Solvingthe bottom layer of the nested optimization problem for a given framecorresponds to optimizing the sizing of the beams and columns specifiedvia the corresponding frame specification while holding the associatedframe lateral loads fixed.

The frame iteration engine executes any number of bottom loop iterationsto solve the bottom layer of the nested optimization for a given framewith respect to the middle loop iteration. To initiate each bottom loopiteration, the frame iteration engine generates a bending moment diagramand a shear diagram for the frame based on the frame lateral loads andthe vertical loads associated with the frame. The frame iteration enginethen iteratively and jointly optimizes the sizing of the beams and thecolumns in the frame based on the bending moment diagram, the sheardiagram, the objective function, and the constraints. After the frameiteration engine optimizes the sizing of the beams and the columns, thebottom loop iteration is complete.

The frame iteration engine can determine whether to execute anotherbottom loop iteration in any technically feasible fashion. If the frameiteration engine does not execute another bottom loop iteration, thenthe frame iteration engine indicates to the frame system iterationcontroller that the frame iteration engine has solved the bottom layerof the nested optimization problem for the frame with respect to themiddle loop iteration.

After the frame system iteration controller determines that the bottomlayer of the nested optimization problem for each of the frames in theframe system with respect to the middle loop iteration is complete, theframe system iteration controller determines whether to execute anothermiddle loop iteration. If the frame system iteration controller does notexecute another middle loop iteration, then the frame system iterationcontroller indicates to the structural system iteration controller thatthe frame system iteration controller has solved the middle layer of thenested optimization problem with respect to the top loop iteration.

The structural system iteration controller can determine whether toexecute another top loop iteration in any technically feasible fashion.If the structural system iteration controller does not execute anothertop loop iteration, then the structural system iteration controller setsthe structural design for the design optimization iteration equal to thecurrent structural design. The system iteration controller also computesthe building objective value for the structural design. The iterativesizing application then provides the structural design and the buildingobjective value to the iterative optimization application, and thedesign optimization iteration is complete.

In response, the iterative optimization application determines whetherto execute another design optimization iteration. The iterativeoptimization application can determine when to execute another designoptimization iteration in any technically feasible fashion (e.g., whenthe building objective value reaches a target value). If the iterativeoptimization application does not execute another design optimizationapplication, then the iterative optimization application provides themost recent version of the structural design and the associated buildingobjective value to the structural design application.

After all of the instances of the iterative optimization applicationhave provided structural designs and associated building objectivevalues to the structural design application, the structural designapplication generates the ranked structural design list. The structuraldesign application then stores and/or transmits any portions of theranked structural design to any number and/or type of softwareapplications in any technically feasible fashion.

At least one technical advantage of the disclosed techniques relative tothe prior art is that, with the disclosed techniques, a design space ofa structural system of a building can be automatically explored togenerate structural designs that are more convergent with the designobjectives while satisfying the design constraints. In that regard, withthe disclosed techniques, by breaking the overall design optimizationproblem into any number of a layout and gravity design optimizationproblem, a frame grid optimization problem, a frame system definitionoptimization problem, and a vertical and lateral load designoptimization problem, the structural design application can efficientlyand systematically explore the design space of the structural system toidentify regions that are optimized for the design objectives.Furthermore, relative to conventional CAD applications, using trainedmachine learning models and/or design and structural engine fundamentalsto evaluate design decisions and dynamically discard inferior partialdesigns enables the structural design application to explore the designspace is a more directed and therefore efficient fashion. As a result,the likelihood that the structural designs are properly optimized forthe design objectives is increased. These technical advantages provideone or more technological improvements over prior art approaches.

1. In some embodiments, a computer-implemented method for automaticallygenerating a design for a structural system of a building comprisesperforming one or more partitioning operations based on a first outlineof a first floor included in a computer-aided design of the building togenerate a first set of segments, generating a first plurality ofsegment designs based on the first set of segments, one or moreconstraints, and one or more design objectives, wherein the firstplurality of segment designs includes at least one segment design foreach of the segments included in the first set of segments, performingone or more merging operations based on the first plurality of segmentdesigns to generate a first set of floor designs, determining a firstcombination of floor designs from multiple sets of floor designs,including the first set of floor designs, based on the one or moredesign objectives, wherein each set of floor designs included in themultiple sets of floor designs is associated with a different floor ofthe computer-aided design of the building, and generating the design forthe structural system of the building based on the first combination offloor designs.

2. The computer-implemented method of clause 1, wherein performing theone or more partitioning operations comprises generating a firsttemplate for the first floor that specifies a slab having a horizontalcross-section that matches the first outline, and partitioning the firsttemplate into the first set of segments, wherein each segment includedin the first set of segments is associated with a different portion ofthe slab.

3. The computer-implemented method of clauses 1 or 2, wherein generatingthe first plurality of segment designs comprises generating a layout fora first segment included in the first set of segments, wherein thelayout specifies at least one slab, at least one beam and at least onecolumn, computing sizing data for the at least one slab, the at leastone beam, and the at least one column based on the layout, the one ormore constraints, and the one or more design objectives, and generatinga first segment design for the first segment based on the layout and thesizing data.

4. The computer-implemented method of any of clauses 1-3, whereincomputing the sizing data comprise sequentially executing a plurality ofoptimization algorithms on the layout based on the one or moreconstraints and the one or more design objectives to generate a firstportion of the sizing data that is associated with the at least oneslab, a second portion of the sizing data that is associated with the atleast one beam, and a third portion of the sizing data that isassociated with the at least one column.

5. The computer-implemented method of any of clauses 1-4, whereingenerating the first plurality of segment designs comprises generating afirst set of potential segment designs for a first segment included inthe first set of segments based on the one or more constraints, whereineach potential segment design included in the first set of potentialsegment designs is associated with a different layout, and performing atleast one ranking or filtering operation on the first set of potentialsegment designs based on the one or more design objectives to determinethe at least one segment designs for the first segment.

6. The computer-implemented method of any of clauses 1-5, whereinperforming the one or more merging operations comprises performing oneor more merging operations between a first subset of the first pluralityof segment designs that is associated with a first segment and a secondsubset of the first plurality of segment designs that is associated witha second segment to generate a first plurality of partial floor designs,and generating the first set of floor designs based on the firstplurality of partial floor designs and a third subset of the firstplurality of segment designs that is not associated with either thefirst segment or the second segment.

7. The computer-implemented method of any of clauses 1-6, wherein eachfloor design included in the first set of floor designs comprises adifferent design for the first floor that is generated based on adifferent subset of the first plurality of segment designs.

8. The computer-implemented method of any of clauses 1-7, whereindetermining the first combination of floor designs comprises executingat least one of a genetic algorithm, a harmony search algorithm, or aninteger optimization algorithm based on the multiple sets of floordesigns and the one or more design objectives.

9. The computer-implemented method of any of clauses 1-8, whereindetermining the first combination of floor designs comprises determininga highest ranked floor design for each set of floor designs included inthe multiple sets of floor designs based on the one or more designobjectives.

10. The computer-implemented method of any of clauses 1-9, wherein theone or more design objectives include at least one of minimizing totalweight, minimizing embodied carbon, minimizing material cost, orminimizing material waste

11. In some embodiments, one or more non-transitory computer readablemedia include instructions that, when executed by one or moreprocessors, cause the one or more processors to automatically generate adesign for a structural system of a building by performing the steps ofperforming one or more partitioning operations based on a first outlineof a first floor included in a computer-aided design of the building togenerate a first set of segments, generating a first plurality ofsegment designs based on the first set of segments, one or moreconstraints, and one or more design objectives, wherein the firstplurality of segment designs includes at least one segment design foreach of the segments included in the first set of segments, performingone or more merging operations based on the first plurality of segmentdesigns to generate a first set of floor designs, determining a firstcombination of floor designs from multiple sets of floor designs,including the first set of floor designs, based on the one or moredesign objectives, wherein each set of floor designs included in themultiple sets of floor designs is associated with a different floor ofthe computer-aided design of the building, and generating the design forthe structural system of the building based on the first combination offloor designs.

12. The one or more non-transitory computer readable media of clause 11,wherein performing the one or more partitioning operations comprisesdetermining a template for the first floor based on the first outlineand at least one rule included in a knowledge base, and partitioning thetemplate into the first set of segments, wherein each segment includedin the first set of segments is associated with a different portion ofthe first floor.

13. The one or more non-transitory computer readable media of clauses 11or 12, wherein generating the first plurality of segment designscomprises generating a layout for a first segment included in the firstset of segments, wherein the layout specifies at least one slab, atleast one beam and at least one column, computing sizing data for the atleast one slab, the at least one beam, and the at least one column basedon the layout, the one or more constraints, and the one or more designobjectives, and generating a first segment design for the first segmentbased on the layout and the sizing data.

14. The one or more non-transitory computer readable media of any ofclauses 11-13, wherein computing the sizing data comprise sequentiallyexecuting a plurality of optimization algorithms on the layout based onthe one or more constraints and the one or more design objectives togenerate a first portion of the sizing data that is associated with theat least one slab, a second portion of the sizing data that isassociated with the at least one beam, and a third portion of the sizingdata that is associated with the at least one column.

15. The one or more non-transitory computer readable media of any ofclauses 11-14, wherein generating the first plurality of segment designscomprises generating a first set of potential segment designs for afirst segment included in the first set of segments based on the one ormore constraints, wherein each potential segment design included in thefirst set of potential segment designs is associated with a differentlayout, and performing at least one ranking or filtering operation onthe first set of potential segment designs based on the one or moredesign objectives to determine the at least one segment design for thefirst segment.

16. The one or more non-transitory computer readable media of any ofclauses 11-15, wherein performing the one or more merging operationscomprises performing one or more merging operations between a firstsubset of the first plurality of segment designs that is associated witha first segment and a second subset of the first plurality of segmentdesigns that is associated with a second segment to generate a firstplurality of partial floor designs, performing at least one filteringoperation on the first plurality of partial floor designs based on theone or more design objectives to determine a first set of partial floordesigns, and generating the first set of floor designs based on thefirst set of partial floor designs and a third subset of the firstplurality of segment designs that is not associated with either thefirst segment or the second segment.

17. The one or more non-transitory computer readable media of any ofclauses 11-16, wherein each floor design included in the first set offloor designs comprises a different design for the first floor that isgenerated based on a different subset of the first plurality of segmentdesigns.

18. The one or more non-transitory computer readable media of any ofclauses 11-17, wherein determining the first combination of floordesigns comprises executing a genetic algorithm on a first value for anobjective function that quantifies the one or more design objectives todetermine a first set of values for the multiple sets of floor designs.

19. The one or more non-transitory computer readable media of any ofclauses 11-18, wherein determining the first combination of floordesigns comprises determining a highest ranked floor design for each setof floor designs included in the multiple sets of floor designs based onthe one or more design objectives.

20. In some embodiments, a system comprises one or more memories storinginstructions and one or more processors coupled to the one or morememories that, when executing the instructions, perform the steps ofperforming one or more partitioning operations based on a first outlineof a first floor included in a computer-aided design of a building togenerate a first set of segments, generating a first plurality ofsegment designs based on the first set of segments, one or moreconstraints, and one or more design objectives, wherein the firstplurality of segment designs includes at least one segment design foreach of the segments included in the first set of segments, performingone or more merging operations based on the first plurality of segmentdesigns to generate a first set of floor designs, determining a firstcombination of floor designs from multiple sets of floor designs,including the first set of floor designs, based on the one or moredesign objectives, wherein each set of floor designs included in themultiple sets of floor designs is associated with a different floor ofthe computer-aided design of the building, and generating a design for astructural system of the building based on the first combination offloor designs.

Any and all combinations of any of the claim elements recited in any ofthe claims and/or any elements described in this application, in anyfashion, fall within the contemplated scope of the embodiments andprotection.

The descriptions of the various embodiments have been presented forpurposes of illustration but are not intended to be exhaustive orlimited to the embodiments disclosed. Many modifications and variationswill be apparent to those of ordinary skill in the art without departingfrom the scope and spirit of the described embodiments. Aspects of thepresent embodiments can be embodied as a system, method, or computerprogram product. Accordingly, aspects of the present disclosure can takethe form of an entirely hardware embodiment, an entirely softwareembodiment (including firmware, resident software, micro-code, etc.) oran embodiment combining software and hardware aspects that can allgenerally be referred to herein as a “module,” a “system,” or a“computer.” In addition, any hardware and/or software technique,process, function, component, engine, module, or system described in thepresent disclosure can be implemented as a circuit or set of circuits.Furthermore, aspects of the present disclosure can take the form of acomputer program product embodied in one or more computer readable mediahaving computer readable program codec embodied thereon.

Any combination of one or more computer readable media can be utilized.Each computer readable medium may be a computer readable signal mediumor a computer readable storage medium. A computer readable storagemedium may be, for example, but not limited to, an electronic, magnetic,optical, electromagnetic, infrared, or semiconductor system, apparatus,or device, or any suitable combination of the foregoing. More specificexamples (a non-exhaustive list) of the computer readable storage mediumwould include the following: an electrical connection having one or morewires, a portable computer diskette, a hard disk, a random accessmemory, a read-only memory, an erasable programmable read-only memory, aFlash memory, an optical fiber, a portable compact disc read-onlymemory, an optical storage device, a magnetic storage device, or anysuitable combination of the foregoing. In the context of this document,a computer readable storage medium can be any tangible medium that cancontain or store a program for use by or in connection with aninstruction execution system, apparatus, or device.

Aspects of the present disclosure are described above with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of thedisclosure. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions canbe provided to a processor of a general-purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine. The instructions, when executed via the processor ofthe computer or other programmable data processing apparatus, enable theimplementation of the functions/acts specified in the flowchart and/orblock diagram block or blocks. Such processors may be, withoutlimitation, general purpose processors, special-purpose processors,application-specific processors, or field-programmable gate arrays.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present disclosure. In this regard, each block in theflowchart or block diagrams can represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock can occur out of the order noted in the figures. For example, twoblocks shown in succession can, in fact, be executed substantiallyconcurrently, or the blocks can sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

While the preceding is directed to embodiments of the presentdisclosure, other and further embodiments of the disclosure can bedevised without departing from the basic scope thereof, and the scopethereof is determined by the claims that follow.

What is claimed is:
 1. A computer-implemented method for automaticallygenerating a design for a structural system of a building, the methodcomprising: performing one or more partitioning operations based on afirst outline of a first floor included in a computer-aided design ofthe building to generate a first set of segments; generating a firstplurality of segment designs based on the first set of segments, one ormore constraints, and one or more design objectives, wherein the firstplurality of segment designs includes at least one segment design foreach of the segments included in the first set of segments; performingone or more merging operations based on the first plurality of segmentdesigns to generate a first set of floor designs; determining a firstcombination of floor designs from multiple sets of floor designs,including the first set of floor designs, based on the one or moredesign objectives, wherein each set of floor designs included in themultiple sets of floor designs is associated with a different floor ofthe computer-aided design of the building; and generating the design forthe structural system of the building based on the first combination offloor designs.
 2. The computer-implemented method of claim 1, whereinperforming the one or more partitioning operations comprises: generatinga first template for the first floor that specifies a slab having ahorizontal cross-section that matches the first outline; andpartitioning the first template into the first set of segments, whereineach segment included in the first set of segments is associated with adifferent portion of the slab.
 3. The computer-implemented method ofclaim 1, wherein generating the first plurality of segment designscomprises: generating a layout for a first segment included in the firstset of segments, wherein the layout specifies at least one slab, atleast one beam and at least one column; computing sizing data for the atleast one slab, the at least one beam, and the at least one column basedon the layout, the one or more constraints, and the one or more designobjectives; and generating a first segment design for the first segmentbased on the layout and the sizing data.
 4. The computer-implementedmethod of claim 3, wherein computing the sizing data comprisesequentially executing a plurality of optimization algorithms on thelayout based on the one or more constraints and the one or more designobjectives to generate a first portion of the sizing data that isassociated with the at least one slab, a second portion of the sizingdata that is associated with the at least one beam, and a third portionof the sizing data that is associated with the at least one column. 5.The computer-implemented method of claim 1, wherein generating the firstplurality of segment designs comprises: generating a first set ofpotential segment designs for a first segment included in the first setof segments based on the one or more constraints, wherein each potentialsegment design included in the first set of potential segment designs isassociated with a different layout; and performing at least one rankingor filtering operation on the first set of potential segment designsbased on the one or more design objectives to determine the at least onesegment designs for the first segment.
 6. The computer-implementedmethod of claim 1, wherein performing the one or more merging operationscomprises: performing one or more merging operations between a firstsubset of the first plurality of segment designs that is associated witha first segment and a second subset of the first plurality of segmentdesigns that is associated with a second segment to generate a firstplurality of partial floor designs; and generating the first set offloor designs based on the first plurality of partial floor designs anda third subset of the first plurality of segment designs that is notassociated with either the first segment or the second segment.
 7. Thecomputer-implemented method of claim 1, wherein each floor designincluded in the first set of floor designs comprises a different designfor the first floor that is generated based on a different subset of thefirst plurality of segment designs.
 8. The computer-implemented methodof claim 1, wherein determining the first combination of floor designscomprises executing at least one of a genetic algorithm, a harmonysearch algorithm, or an integer optimization algorithm based on themultiple sets of floor designs and the one or more design objectives. 9.The computer-implemented method of claim 1, wherein determining thefirst combination of floor designs comprises determining a highestranked floor design for each set of floor designs included in themultiple sets of floor designs based on the one or more designobjectives.
 10. The computer-implemented method of claim 1, wherein theone or more design objectives include at least one of minimizing totalweight, minimizing embodied carbon, minimizing material cost, orminimizing material waste
 11. One or more non-transitory computerreadable media including instructions that, when executed by one or moreprocessors, cause the one or more processors to automatically generate adesign for a structural system of a building by performing the steps of:performing one or more partitioning operations based on a first outlineof a first floor included in a computer-aided design of the building togenerate a first set of segments; generating a first plurality ofsegment designs based on the first set of segments, one or moreconstraints, and one or more design objectives, wherein the firstplurality of segment designs includes at least one segment design foreach of the segments included in the first set of segments; performingone or more merging operations based on the first plurality of segmentdesigns to generate a first set of floor designs; determining a firstcombination of floor designs from multiple sets of floor designs,including the first set of floor designs, based on the one or moredesign objectives, wherein each set of floor designs included in themultiple sets of floor designs is associated with a different floor ofthe computer-aided design of the building; and generating the design forthe structural system of the building based on the first combination offloor designs.
 12. The one or more non-transitory computer readablemedia of claim 11, wherein performing the one or more partitioningoperations comprises: determining a template for the first floor basedon the first outline and at least one rule included in a knowledge base;and partitioning the template into the first set of segments, whereineach segment included in the first set of segments is associated with adifferent portion of the first floor.
 13. The one or more non-transitorycomputer readable media of claim 11, wherein generating the firstplurality of segment designs comprises: generating a layout for a firstsegment included in the first set of segments, wherein the layoutspecifies at least one slab, at least one beam and at least one column;computing sizing data for the at least one slab, the at least one beam,and the at least one column based on the layout, the one or moreconstraints, and the one or more design objectives; and generating afirst segment design for the first segment based on the layout and thesizing data.
 14. The one or more non-transitory computer readable mediaof claim 13, wherein computing the sizing data comprise sequentiallyexecuting a plurality of optimization algorithms on the layout based onthe one or more constraints and the one or more design objectives togenerate a first portion of the sizing data that is associated with theat least one slab, a second portion of the sizing data that isassociated with the at least one beam, and a third portion of the sizingdata that is associated with the at least one column.
 15. The one ormore non-transitory computer readable media of claim 11, whereingenerating the first plurality of segment designs comprises: generatinga first set of potential segment designs for a first segment included inthe first set of segments based on the one or more constraints, whereineach potential segment design included in the first set of potentialsegment designs is associated with a different layout; and performing atleast one ranking or filtering operation on the first set of potentialsegment designs based on the one or more design objectives to determinethe at least one segment design for the first segment.
 16. The one ormore non-transitory computer readable media of claim 11, whereinperforming the one or more merging operations comprises: performing oneor more merging operations between a first subset of the first pluralityof segment designs that is associated with a first segment and a secondsubset of the first plurality of segment designs that is associated witha second segment to generate a first plurality of partial floor designs;performing at least one filtering operation on the first plurality ofpartial floor designs based on the one or more design objectives todetermine a first set of partial floor designs; and generating the firstset of floor designs based on the first set of partial floor designs anda third subset of the first plurality of segment designs that is notassociated with either the first segment or the second segment.
 17. Theone or more non-transitory computer readable media of claim 11, whereineach floor design included in the first set of floor designs comprises adifferent design for the first floor that is generated based on adifferent subset of the first plurality of segment designs.
 18. The oneor more non-transitory computer readable media of claim 11, whereindetermining the first combination of floor designs comprises executing agenetic algorithm on a first value for an objective function thatquantifies the one or more design objectives to determine a first set ofvalues for the multiple sets of floor designs.
 19. The one or morenon-transitory computer readable media of claim 11, wherein determiningthe first combination of floor designs comprises determining a highestranked floor design for each set of floor designs included in themultiple sets of floor designs based on the one or more designobjectives.
 20. A system comprising: one or more memories storinginstructions; and one or more processors coupled to the one or morememories that, when executing the instructions, perform the steps of:performing one or more partitioning operations based on a first outlineof a first floor included in a computer-aided design of a building togenerate a first set of segments; generating a first plurality ofsegment designs based on the first set of segments, one or moreconstraints, and one or more design objectives, wherein the firstplurality of segment designs includes at least one segment design foreach of the segments included in the first set of segments; performingone or more merging operations based on the first plurality of segmentdesigns to generate a first set of floor designs; determining a firstcombination of floor designs from multiple sets of floor designs,including the first set of floor designs, based on the one or moredesign objectives, wherein each set of floor designs included in themultiple sets of floor designs is associated with a different floor ofthe computer-aided design of the building; and generating a design for astructural system of the building based on the first combination offloor designs.